./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme --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 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:41:07,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:41:07,826 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:41:07,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:41:07,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:41:07,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:41:07,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:41:07,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:41:07,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:41:07,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:41:07,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:41:07,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:41:07,874 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:41:07,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:41:07,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:41:07,876 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:41:07,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:41:07,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:41:07,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:41:07,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:41:07,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:41:07,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:41:07,881 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:41:07,882 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:41:07,883 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:41:07,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:41:07,884 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:41:07,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:41:07,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:41:07,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:41:07,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:41:07,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:41:07,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:41:07,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:41:07,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:41:07,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:41:07,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:41:07,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:41:07,891 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:41:07,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:41:07,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:41:07,893 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme 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 -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a [2023-11-26 10:41:08,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:41:08,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:41:08,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:41:08,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:41:08,228 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:41:08,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2023-11-26 10:41:11,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:41:12,233 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:41:12,234 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2023-11-26 10:41:12,246 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/data/f0cdacc34/239cc8a2ce5b4e6b8358abc9a18f2215/FLAGa452f5391 [2023-11-26 10:41:12,266 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/data/f0cdacc34/239cc8a2ce5b4e6b8358abc9a18f2215 [2023-11-26 10:41:12,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:41:12,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:41:12,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:41:12,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:41:12,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:41:12,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff824ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12, skipping insertion in model container [2023-11-26 10:41:12,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,317 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:41:12,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:41:12,595 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:41:12,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:41:12,658 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:41:12,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12 WrapperNode [2023-11-26 10:41:12,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:41:12,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:41:12,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:41:12,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:41:12,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,735 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 331 [2023-11-26 10:41:12,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:41:12,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:41:12,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:41:12,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:41:12,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:41:12,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:41:12,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:41:12,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:41:12,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (1/1) ... [2023-11-26 10:41:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:41:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:41:12,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:41:12,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:41:12,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:41:12,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 10:41:12,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 10:41:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 10:41:12,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 10:41:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 10:41:12,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 10:41:12,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:41:12,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:41:12,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:41:12,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:41:12,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:41:12,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 10:41:12,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:41:12,951 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:41:13,200 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:41:13,204 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:41:14,041 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:41:14,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:41:14,067 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:41:14,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:14 BoogieIcfgContainer [2023-11-26 10:41:14,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:41:14,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:41:14,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:41:14,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:41:14,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:41:12" (1/3) ... [2023-11-26 10:41:14,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a206fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:41:14, skipping insertion in model container [2023-11-26 10:41:14,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:12" (2/3) ... [2023-11-26 10:41:14,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a206fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:41:14, skipping insertion in model container [2023-11-26 10:41:14,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:14" (3/3) ... [2023-11-26 10:41:14,087 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2023-11-26 10:41:14,118 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:41:14,129 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:41:14,130 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-26 10:41:14,130 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:41:14,367 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 10:41:14,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 416 places, 427 transitions, 875 flow [2023-11-26 10:41:14,701 INFO L124 PetriNetUnfolderBase]: 21/424 cut-off events. [2023-11-26 10:41:14,701 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 10:41:14,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 424 events. 21/424 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1118 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 277. Up to 2 conditions per place. [2023-11-26 10:41:14,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 416 places, 427 transitions, 875 flow [2023-11-26 10:41:14,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 388 places, 397 transitions, 812 flow [2023-11-26 10:41:14,748 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:41:14,757 INFO L357 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, mHoare=true, 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;@70e9c176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:41:14,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-11-26 10:41:14,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:41:14,766 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2023-11-26 10:41:14,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:41:14,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:14,767 INFO L208 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] [2023-11-26 10:41:14,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:14,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash -710500901, now seen corresponding path program 1 times [2023-11-26 10:41:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446671325] [2023-11-26 10:41:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446671325] [2023-11-26 10:41:15,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446671325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:15,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:15,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181835553] [2023-11-26 10:41:15,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:15,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:15,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:15,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:15,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 427 [2023-11-26 10:41:15,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 397 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:15,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 427 [2023-11-26 10:41:15,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:15,603 INFO L124 PetriNetUnfolderBase]: 26/585 cut-off events. [2023-11-26 10:41:15,603 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 10:41:15,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 585 events. 26/585 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2404 event pairs, 5 based on Foata normal form. 20/511 useless extension candidates. Maximal degree in co-relation 448. Up to 22 conditions per place. [2023-11-26 10:41:15,623 INFO L140 encePairwiseOnDemand]: 418/427 looper letters, 11 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2023-11-26 10:41:15,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 390 transitions, 824 flow [2023-11-26 10:41:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2023-11-26 10:41:15,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9617486338797814 [2023-11-26 10:41:15,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1232 transitions. [2023-11-26 10:41:15,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1232 transitions. [2023-11-26 10:41:15,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:15,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1232 transitions. [2023-11-26 10:41:15,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.6666666666667) internal successors, (1232), 3 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,697 INFO L175 Difference]: Start difference. First operand has 388 places, 397 transitions, 812 flow. Second operand 3 states and 1232 transitions. [2023-11-26 10:41:15,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 390 transitions, 824 flow [2023-11-26 10:41:15,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 390 transitions, 812 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 10:41:15,726 INFO L231 Difference]: Finished difference. Result has 383 places, 390 transitions, 790 flow [2023-11-26 10:41:15,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=383, PETRI_TRANSITIONS=390} [2023-11-26 10:41:15,735 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -5 predicate places. [2023-11-26 10:41:15,736 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 390 transitions, 790 flow [2023-11-26 10:41:15,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:15,738 INFO L208 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] [2023-11-26 10:41:15,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:41:15,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:15,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash 369676486, now seen corresponding path program 1 times [2023-11-26 10:41:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:15,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349602037] [2023-11-26 10:41:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349602037] [2023-11-26 10:41:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349602037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376564242] [2023-11-26 10:41:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:15,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:15,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 427 [2023-11-26 10:41:15,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 390 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:15,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:15,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 427 [2023-11-26 10:41:15,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:16,238 INFO L124 PetriNetUnfolderBase]: 36/753 cut-off events. [2023-11-26 10:41:16,239 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:41:16,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 753 events. 36/753 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3601 event pairs, 7 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 754. Up to 25 conditions per place. [2023-11-26 10:41:16,259 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 0/389 dead transitions. [2023-11-26 10:41:16,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 389 transitions, 814 flow [2023-11-26 10:41:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1226 transitions. [2023-11-26 10:41:16,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570647931303669 [2023-11-26 10:41:16,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1226 transitions. [2023-11-26 10:41:16,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1226 transitions. [2023-11-26 10:41:16,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:16,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1226 transitions. [2023-11-26 10:41:16,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,282 INFO L175 Difference]: Start difference. First operand has 383 places, 390 transitions, 790 flow. Second operand 3 states and 1226 transitions. [2023-11-26 10:41:16,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 389 transitions, 814 flow [2023-11-26 10:41:16,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 389 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:16,296 INFO L231 Difference]: Finished difference. Result has 382 places, 389 transitions, 788 flow [2023-11-26 10:41:16,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=382, PETRI_TRANSITIONS=389} [2023-11-26 10:41:16,298 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -6 predicate places. [2023-11-26 10:41:16,298 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 389 transitions, 788 flow [2023-11-26 10:41:16,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:16,302 INFO L208 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] [2023-11-26 10:41:16,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:41:16,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:16,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1337604084, now seen corresponding path program 1 times [2023-11-26 10:41:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:16,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436664562] [2023-11-26 10:41:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:16,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436664562] [2023-11-26 10:41:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436664562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:16,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:16,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556689477] [2023-11-26 10:41:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:16,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:16,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 427 [2023-11-26 10:41:16,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 389 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:16,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 427 [2023-11-26 10:41:16,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:16,686 INFO L124 PetriNetUnfolderBase]: 24/519 cut-off events. [2023-11-26 10:41:16,686 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 10:41:16,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 519 events. 24/519 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1912 event pairs, 7 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 509. Up to 25 conditions per place. [2023-11-26 10:41:16,703 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2023-11-26 10:41:16,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 388 transitions, 812 flow [2023-11-26 10:41:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1226 transitions. [2023-11-26 10:41:16,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570647931303669 [2023-11-26 10:41:16,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1226 transitions. [2023-11-26 10:41:16,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1226 transitions. [2023-11-26 10:41:16,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:16,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1226 transitions. [2023-11-26 10:41:16,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,723 INFO L175 Difference]: Start difference. First operand has 382 places, 389 transitions, 788 flow. Second operand 3 states and 1226 transitions. [2023-11-26 10:41:16,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 388 transitions, 812 flow [2023-11-26 10:41:16,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 388 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:16,736 INFO L231 Difference]: Finished difference. Result has 381 places, 388 transitions, 786 flow [2023-11-26 10:41:16,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=381, PETRI_TRANSITIONS=388} [2023-11-26 10:41:16,739 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -7 predicate places. [2023-11-26 10:41:16,739 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 388 transitions, 786 flow [2023-11-26 10:41:16,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:16,742 INFO L208 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] [2023-11-26 10:41:16,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:41:16,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:16,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 855817630, now seen corresponding path program 1 times [2023-11-26 10:41:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23128919] [2023-11-26 10:41:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:16,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23128919] [2023-11-26 10:41:16,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23128919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:16,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:16,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202177732] [2023-11-26 10:41:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:16,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:16,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 427 [2023-11-26 10:41:16,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 388 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:16,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:16,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 427 [2023-11-26 10:41:16,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:17,175 INFO L124 PetriNetUnfolderBase]: 30/641 cut-off events. [2023-11-26 10:41:17,175 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-26 10:41:17,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 641 events. 30/641 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2980 event pairs, 5 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 621. Up to 22 conditions per place. [2023-11-26 10:41:17,197 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2023-11-26 10:41:17,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 387 transitions, 810 flow [2023-11-26 10:41:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1226 transitions. [2023-11-26 10:41:17,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570647931303669 [2023-11-26 10:41:17,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1226 transitions. [2023-11-26 10:41:17,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1226 transitions. [2023-11-26 10:41:17,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:17,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1226 transitions. [2023-11-26 10:41:17,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,222 INFO L175 Difference]: Start difference. First operand has 381 places, 388 transitions, 786 flow. Second operand 3 states and 1226 transitions. [2023-11-26 10:41:17,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 387 transitions, 810 flow [2023-11-26 10:41:17,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 387 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:17,238 INFO L231 Difference]: Finished difference. Result has 380 places, 387 transitions, 784 flow [2023-11-26 10:41:17,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=380, PETRI_TRANSITIONS=387} [2023-11-26 10:41:17,243 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -8 predicate places. [2023-11-26 10:41:17,243 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 387 transitions, 784 flow [2023-11-26 10:41:17,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:17,245 INFO L208 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] [2023-11-26 10:41:17,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:41:17,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:17,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1843246072, now seen corresponding path program 1 times [2023-11-26 10:41:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:17,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062873554] [2023-11-26 10:41:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:17,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:17,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:17,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062873554] [2023-11-26 10:41:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062873554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:17,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:17,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420501583] [2023-11-26 10:41:17,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:17,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:17,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:17,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:17,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:17,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 427 [2023-11-26 10:41:17,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 387 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:17,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 427 [2023-11-26 10:41:17,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:17,712 INFO L124 PetriNetUnfolderBase]: 53/922 cut-off events. [2023-11-26 10:41:17,712 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:41:17,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 922 events. 53/922 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5282 event pairs, 12 based on Foata normal form. 0/762 useless extension candidates. Maximal degree in co-relation 913. Up to 35 conditions per place. [2023-11-26 10:41:17,740 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 12 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2023-11-26 10:41:17,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 386 transitions, 810 flow [2023-11-26 10:41:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2023-11-26 10:41:17,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.955503512880562 [2023-11-26 10:41:17,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1224 transitions. [2023-11-26 10:41:17,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1224 transitions. [2023-11-26 10:41:17,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:17,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1224 transitions. [2023-11-26 10:41:17,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,781 INFO L175 Difference]: Start difference. First operand has 380 places, 387 transitions, 784 flow. Second operand 3 states and 1224 transitions. [2023-11-26 10:41:17,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 386 transitions, 810 flow [2023-11-26 10:41:17,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 386 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:17,791 INFO L231 Difference]: Finished difference. Result has 379 places, 386 transitions, 782 flow [2023-11-26 10:41:17,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=379, PETRI_TRANSITIONS=386} [2023-11-26 10:41:17,794 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -9 predicate places. [2023-11-26 10:41:17,794 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 386 transitions, 782 flow [2023-11-26 10:41:17,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:17,796 INFO L208 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] [2023-11-26 10:41:17,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:41:17,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:17,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 495978405, now seen corresponding path program 1 times [2023-11-26 10:41:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:17,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245483599] [2023-11-26 10:41:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245483599] [2023-11-26 10:41:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245483599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:17,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005837508] [2023-11-26 10:41:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:17,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:17,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2023-11-26 10:41:17,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 386 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:17,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2023-11-26 10:41:17,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:18,104 INFO L124 PetriNetUnfolderBase]: 65/981 cut-off events. [2023-11-26 10:41:18,105 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-26 10:41:18,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 981 events. 65/981 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5233 event pairs, 20 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 975. Up to 50 conditions per place. [2023-11-26 10:41:18,130 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 13 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2023-11-26 10:41:18,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 385 transitions, 810 flow [2023-11-26 10:41:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2023-11-26 10:41:18,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9539422326307572 [2023-11-26 10:41:18,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1222 transitions. [2023-11-26 10:41:18,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1222 transitions. [2023-11-26 10:41:18,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:18,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1222 transitions. [2023-11-26 10:41:18,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,149 INFO L175 Difference]: Start difference. First operand has 379 places, 386 transitions, 782 flow. Second operand 3 states and 1222 transitions. [2023-11-26 10:41:18,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 385 transitions, 810 flow [2023-11-26 10:41:18,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 385 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:18,161 INFO L231 Difference]: Finished difference. Result has 378 places, 385 transitions, 780 flow [2023-11-26 10:41:18,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=378, PETRI_TRANSITIONS=385} [2023-11-26 10:41:18,163 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -10 predicate places. [2023-11-26 10:41:18,163 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 385 transitions, 780 flow [2023-11-26 10:41:18,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:18,165 INFO L208 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] [2023-11-26 10:41:18,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:41:18,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:18,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1515225271, now seen corresponding path program 1 times [2023-11-26 10:41:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:18,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075457431] [2023-11-26 10:41:18,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:18,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:18,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075457431] [2023-11-26 10:41:18,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075457431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:18,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:18,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455665728] [2023-11-26 10:41:18,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:18,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:18,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 427 [2023-11-26 10:41:18,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 385 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:18,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 427 [2023-11-26 10:41:18,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:18,448 INFO L124 PetriNetUnfolderBase]: 31/686 cut-off events. [2023-11-26 10:41:18,449 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 10:41:18,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 686 events. 31/686 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2915 event pairs, 5 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 646. Up to 23 conditions per place. [2023-11-26 10:41:18,463 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2023-11-26 10:41:18,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 384 transitions, 804 flow [2023-11-26 10:41:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1226 transitions. [2023-11-26 10:41:18,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570647931303669 [2023-11-26 10:41:18,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1226 transitions. [2023-11-26 10:41:18,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1226 transitions. [2023-11-26 10:41:18,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:18,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1226 transitions. [2023-11-26 10:41:18,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,478 INFO L175 Difference]: Start difference. First operand has 378 places, 385 transitions, 780 flow. Second operand 3 states and 1226 transitions. [2023-11-26 10:41:18,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 384 transitions, 804 flow [2023-11-26 10:41:18,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 384 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:18,487 INFO L231 Difference]: Finished difference. Result has 377 places, 384 transitions, 778 flow [2023-11-26 10:41:18,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=377, PETRI_TRANSITIONS=384} [2023-11-26 10:41:18,489 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -11 predicate places. [2023-11-26 10:41:18,489 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 384 transitions, 778 flow [2023-11-26 10:41:18,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:18,491 INFO L208 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] [2023-11-26 10:41:18,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:41:18,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:18,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:18,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1150519228, now seen corresponding path program 1 times [2023-11-26 10:41:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501486520] [2023-11-26 10:41:18,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:18,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:18,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:18,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501486520] [2023-11-26 10:41:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501486520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:18,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:18,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:18,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390560119] [2023-11-26 10:41:18,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:18,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:18,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:18,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:18,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:18,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 427 [2023-11-26 10:41:18,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 384 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:18,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 427 [2023-11-26 10:41:18,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:18,785 INFO L124 PetriNetUnfolderBase]: 53/1012 cut-off events. [2023-11-26 10:41:18,786 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:41:18,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 1012 events. 53/1012 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6302 event pairs, 12 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 982. Up to 35 conditions per place. [2023-11-26 10:41:18,809 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 12 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2023-11-26 10:41:18,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 383 transitions, 804 flow [2023-11-26 10:41:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2023-11-26 10:41:18,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.955503512880562 [2023-11-26 10:41:18,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1224 transitions. [2023-11-26 10:41:18,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1224 transitions. [2023-11-26 10:41:18,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:18,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1224 transitions. [2023-11-26 10:41:18,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,825 INFO L175 Difference]: Start difference. First operand has 377 places, 384 transitions, 778 flow. Second operand 3 states and 1224 transitions. [2023-11-26 10:41:18,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 383 transitions, 804 flow [2023-11-26 10:41:18,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 383 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:18,836 INFO L231 Difference]: Finished difference. Result has 376 places, 383 transitions, 776 flow [2023-11-26 10:41:18,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=376, PETRI_TRANSITIONS=383} [2023-11-26 10:41:18,837 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -12 predicate places. [2023-11-26 10:41:18,838 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 383 transitions, 776 flow [2023-11-26 10:41:18,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:18,839 INFO L208 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] [2023-11-26 10:41:18,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:41:18,840 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:18,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash 582163375, now seen corresponding path program 1 times [2023-11-26 10:41:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136629362] [2023-11-26 10:41:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136629362] [2023-11-26 10:41:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136629362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:18,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768299480] [2023-11-26 10:41:18,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:18,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:18,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:18,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:18,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:18,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2023-11-26 10:41:18,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 383 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:18,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:18,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2023-11-26 10:41:18,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:19,170 INFO L124 PetriNetUnfolderBase]: 41/668 cut-off events. [2023-11-26 10:41:19,170 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-26 10:41:19,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 668 events. 41/668 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3258 event pairs, 20 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 641. Up to 50 conditions per place. [2023-11-26 10:41:19,189 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 13 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2023-11-26 10:41:19,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 382 transitions, 804 flow [2023-11-26 10:41:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2023-11-26 10:41:19,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9539422326307572 [2023-11-26 10:41:19,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1222 transitions. [2023-11-26 10:41:19,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1222 transitions. [2023-11-26 10:41:19,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:19,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1222 transitions. [2023-11-26 10:41:19,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,214 INFO L175 Difference]: Start difference. First operand has 376 places, 383 transitions, 776 flow. Second operand 3 states and 1222 transitions. [2023-11-26 10:41:19,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 382 transitions, 804 flow [2023-11-26 10:41:19,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 382 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:19,224 INFO L231 Difference]: Finished difference. Result has 375 places, 382 transitions, 774 flow [2023-11-26 10:41:19,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=375, PETRI_TRANSITIONS=382} [2023-11-26 10:41:19,235 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -13 predicate places. [2023-11-26 10:41:19,235 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 382 transitions, 774 flow [2023-11-26 10:41:19,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:19,237 INFO L208 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] [2023-11-26 10:41:19,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:41:19,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:19,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash 262927338, now seen corresponding path program 1 times [2023-11-26 10:41:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:19,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068765468] [2023-11-26 10:41:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:19,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:19,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068765468] [2023-11-26 10:41:19,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068765468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:19,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:19,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069616593] [2023-11-26 10:41:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:19,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:19,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 427 [2023-11-26 10:41:19,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 382 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:19,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 427 [2023-11-26 10:41:19,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:19,552 INFO L124 PetriNetUnfolderBase]: 49/848 cut-off events. [2023-11-26 10:41:19,552 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 10:41:19,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 848 events. 49/848 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4244 event pairs, 6 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 800. Up to 31 conditions per place. [2023-11-26 10:41:19,569 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 13 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2023-11-26 10:41:19,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 384 transitions, 810 flow [2023-11-26 10:41:19,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2023-11-26 10:41:19,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640905542544886 [2023-11-26 10:41:19,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2023-11-26 10:41:19,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2023-11-26 10:41:19,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:19,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2023-11-26 10:41:19,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,583 INFO L175 Difference]: Start difference. First operand has 375 places, 382 transitions, 774 flow. Second operand 3 states and 1235 transitions. [2023-11-26 10:41:19,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 384 transitions, 810 flow [2023-11-26 10:41:19,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 384 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:19,593 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 780 flow [2023-11-26 10:41:19,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2023-11-26 10:41:19,594 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -14 predicate places. [2023-11-26 10:41:19,595 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 780 flow [2023-11-26 10:41:19,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:19,596 INFO L208 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] [2023-11-26 10:41:19,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:41:19,596 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:19,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1151056283, now seen corresponding path program 1 times [2023-11-26 10:41:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107233516] [2023-11-26 10:41:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107233516] [2023-11-26 10:41:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107233516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025203351] [2023-11-26 10:41:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:19,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:19,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 427 [2023-11-26 10:41:19,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:19,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 427 [2023-11-26 10:41:19,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:19,965 INFO L124 PetriNetUnfolderBase]: 102/1390 cut-off events. [2023-11-26 10:41:19,965 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-26 10:41:19,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 1390 events. 102/1390 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10237 event pairs, 10 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 1314. Up to 73 conditions per place. [2023-11-26 10:41:19,998 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 15 selfloop transitions, 3 changer transitions 0/384 dead transitions. [2023-11-26 10:41:19,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 384 transitions, 822 flow [2023-11-26 10:41:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2023-11-26 10:41:20,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9601873536299765 [2023-11-26 10:41:20,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1230 transitions. [2023-11-26 10:41:20,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1230 transitions. [2023-11-26 10:41:20,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:20,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1230 transitions. [2023-11-26 10:41:20,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,012 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 780 flow. Second operand 3 states and 1230 transitions. [2023-11-26 10:41:20,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 384 transitions, 822 flow [2023-11-26 10:41:20,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 384 transitions, 822 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:20,065 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 795 flow [2023-11-26 10:41:20,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2023-11-26 10:41:20,066 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -14 predicate places. [2023-11-26 10:41:20,066 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 795 flow [2023-11-26 10:41:20,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:20,067 INFO L208 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] [2023-11-26 10:41:20,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:41:20,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:20,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash -68248109, now seen corresponding path program 1 times [2023-11-26 10:41:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753640371] [2023-11-26 10:41:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753640371] [2023-11-26 10:41:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753640371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368358810] [2023-11-26 10:41:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:20,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:20,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 427 [2023-11-26 10:41:20,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:20,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 427 [2023-11-26 10:41:20,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:20,427 INFO L124 PetriNetUnfolderBase]: 57/1123 cut-off events. [2023-11-26 10:41:20,427 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-26 10:41:20,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1123 events. 57/1123 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7009 event pairs, 2 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 996. Up to 38 conditions per place. [2023-11-26 10:41:20,461 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 16 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2023-11-26 10:41:20,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 387 transitions, 846 flow [2023-11-26 10:41:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1238 transitions. [2023-11-26 10:41:20,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664324746291959 [2023-11-26 10:41:20,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1238 transitions. [2023-11-26 10:41:20,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1238 transitions. [2023-11-26 10:41:20,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:20,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1238 transitions. [2023-11-26 10:41:20,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,476 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 795 flow. Second operand 3 states and 1238 transitions. [2023-11-26 10:41:20,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 387 transitions, 846 flow [2023-11-26 10:41:20,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 387 transitions, 846 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:20,487 INFO L231 Difference]: Finished difference. Result has 375 places, 382 transitions, 805 flow [2023-11-26 10:41:20,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=375, PETRI_TRANSITIONS=382} [2023-11-26 10:41:20,488 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -13 predicate places. [2023-11-26 10:41:20,489 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 382 transitions, 805 flow [2023-11-26 10:41:20,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:20,490 INFO L208 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] [2023-11-26 10:41:20,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:41:20,490 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:20,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash 443593846, now seen corresponding path program 1 times [2023-11-26 10:41:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682784677] [2023-11-26 10:41:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:20,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:20,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682784677] [2023-11-26 10:41:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682784677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:20,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958650170] [2023-11-26 10:41:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:20,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:20,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:20,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 427 [2023-11-26 10:41:20,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 382 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:20,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 427 [2023-11-26 10:41:20,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:20,893 INFO L124 PetriNetUnfolderBase]: 59/1089 cut-off events. [2023-11-26 10:41:20,894 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 10:41:20,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1089 events. 59/1089 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7183 event pairs, 8 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 996. Up to 32 conditions per place. [2023-11-26 10:41:20,925 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2023-11-26 10:41:20,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 383 transitions, 835 flow [2023-11-26 10:41:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2023-11-26 10:41:20,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640905542544886 [2023-11-26 10:41:20,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2023-11-26 10:41:20,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2023-11-26 10:41:20,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:20,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2023-11-26 10:41:20,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,940 INFO L175 Difference]: Start difference. First operand has 375 places, 382 transitions, 805 flow. Second operand 3 states and 1235 transitions. [2023-11-26 10:41:20,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 383 transitions, 835 flow [2023-11-26 10:41:20,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 383 transitions, 835 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:20,950 INFO L231 Difference]: Finished difference. Result has 376 places, 381 transitions, 807 flow [2023-11-26 10:41:20,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=376, PETRI_TRANSITIONS=381} [2023-11-26 10:41:20,951 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -12 predicate places. [2023-11-26 10:41:20,952 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 381 transitions, 807 flow [2023-11-26 10:41:20,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:20,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:20,953 INFO L208 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] [2023-11-26 10:41:20,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:41:20,953 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:20,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1658900016, now seen corresponding path program 1 times [2023-11-26 10:41:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696031209] [2023-11-26 10:41:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:21,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696031209] [2023-11-26 10:41:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696031209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255731239] [2023-11-26 10:41:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:21,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:21,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:21,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 427 [2023-11-26 10:41:21,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 807 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:21,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 427 [2023-11-26 10:41:21,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:21,466 INFO L124 PetriNetUnfolderBase]: 105/1815 cut-off events. [2023-11-26 10:41:21,466 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2023-11-26 10:41:21,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 1815 events. 105/1815 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14645 event pairs, 10 based on Foata normal form. 1/1565 useless extension candidates. Maximal degree in co-relation 1781. Up to 94 conditions per place. [2023-11-26 10:41:21,511 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 18 selfloop transitions, 3 changer transitions 0/386 dead transitions. [2023-11-26 10:41:21,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 386 transitions, 864 flow [2023-11-26 10:41:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2023-11-26 10:41:21,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625292740046838 [2023-11-26 10:41:21,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1233 transitions. [2023-11-26 10:41:21,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1233 transitions. [2023-11-26 10:41:21,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:21,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1233 transitions. [2023-11-26 10:41:21,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,526 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 807 flow. Second operand 3 states and 1233 transitions. [2023-11-26 10:41:21,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 386 transitions, 864 flow [2023-11-26 10:41:21,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 386 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:21,537 INFO L231 Difference]: Finished difference. Result has 374 places, 381 transitions, 818 flow [2023-11-26 10:41:21,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=374, PETRI_TRANSITIONS=381} [2023-11-26 10:41:21,539 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -14 predicate places. [2023-11-26 10:41:21,539 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 381 transitions, 818 flow [2023-11-26 10:41:21,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:21,540 INFO L208 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] [2023-11-26 10:41:21,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:41:21,541 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:21,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1489418349, now seen corresponding path program 1 times [2023-11-26 10:41:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:21,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568778112] [2023-11-26 10:41:21,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:21,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:21,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:21,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568778112] [2023-11-26 10:41:21,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568778112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:21,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:21,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256379499] [2023-11-26 10:41:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:21,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:21,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:21,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:21,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2023-11-26 10:41:21,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 381 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:21,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2023-11-26 10:41:21,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:22,621 INFO L124 PetriNetUnfolderBase]: 364/5017 cut-off events. [2023-11-26 10:41:22,622 INFO L125 PetriNetUnfolderBase]: For 69/83 co-relation queries the response was YES. [2023-11-26 10:41:22,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5510 conditions, 5017 events. 364/5017 cut-off events. For 69/83 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 55915 event pairs, 60 based on Foata normal form. 0/4311 useless extension candidates. Maximal degree in co-relation 4757. Up to 331 conditions per place. [2023-11-26 10:41:22,708 INFO L140 encePairwiseOnDemand]: 419/427 looper letters, 17 selfloop transitions, 4 changer transitions 0/383 dead transitions. [2023-11-26 10:41:22,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 383 transitions, 866 flow [2023-11-26 10:41:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1225 transitions. [2023-11-26 10:41:22,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9562841530054644 [2023-11-26 10:41:22,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1225 transitions. [2023-11-26 10:41:22,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1225 transitions. [2023-11-26 10:41:22,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:22,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1225 transitions. [2023-11-26 10:41:22,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:22,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:22,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:22,721 INFO L175 Difference]: Start difference. First operand has 374 places, 381 transitions, 818 flow. Second operand 3 states and 1225 transitions. [2023-11-26 10:41:22,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 383 transitions, 866 flow [2023-11-26 10:41:22,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 383 transitions, 866 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:22,733 INFO L231 Difference]: Finished difference. Result has 373 places, 381 transitions, 838 flow [2023-11-26 10:41:22,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=373, PETRI_TRANSITIONS=381} [2023-11-26 10:41:22,735 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -15 predicate places. [2023-11-26 10:41:22,735 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 381 transitions, 838 flow [2023-11-26 10:41:22,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:22,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:22,736 INFO L208 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] [2023-11-26 10:41:22,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:41:22,737 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:22,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1928908767, now seen corresponding path program 1 times [2023-11-26 10:41:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:22,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320332669] [2023-11-26 10:41:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:22,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:22,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320332669] [2023-11-26 10:41:22,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320332669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:22,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:22,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694632838] [2023-11-26 10:41:22,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:22,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:22,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:22,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:22,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 427 [2023-11-26 10:41:22,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 381 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:22,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:22,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 427 [2023-11-26 10:41:22,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:23,769 INFO L124 PetriNetUnfolderBase]: 121/2912 cut-off events. [2023-11-26 10:41:23,769 INFO L125 PetriNetUnfolderBase]: For 45/47 co-relation queries the response was YES. [2023-11-26 10:41:23,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 2912 events. 121/2912 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 25586 event pairs, 6 based on Foata normal form. 0/2572 useless extension candidates. Maximal degree in co-relation 2729. Up to 114 conditions per place. [2023-11-26 10:41:23,833 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 16 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2023-11-26 10:41:23,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 386 transitions, 889 flow [2023-11-26 10:41:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1238 transitions. [2023-11-26 10:41:23,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664324746291959 [2023-11-26 10:41:23,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1238 transitions. [2023-11-26 10:41:23,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1238 transitions. [2023-11-26 10:41:23,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:23,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1238 transitions. [2023-11-26 10:41:23,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:23,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:23,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:23,850 INFO L175 Difference]: Start difference. First operand has 373 places, 381 transitions, 838 flow. Second operand 3 states and 1238 transitions. [2023-11-26 10:41:23,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 386 transitions, 889 flow [2023-11-26 10:41:23,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 386 transitions, 889 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:23,864 INFO L231 Difference]: Finished difference. Result has 374 places, 381 transitions, 848 flow [2023-11-26 10:41:23,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=374, PETRI_TRANSITIONS=381} [2023-11-26 10:41:23,865 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -14 predicate places. [2023-11-26 10:41:23,866 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 381 transitions, 848 flow [2023-11-26 10:41:23,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:23,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:23,869 INFO L208 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] [2023-11-26 10:41:23,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:41:23,869 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:23,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1744514302, now seen corresponding path program 1 times [2023-11-26 10:41:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120093497] [2023-11-26 10:41:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120093497] [2023-11-26 10:41:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120093497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:23,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436244256] [2023-11-26 10:41:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:23,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:23,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:23,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 427 [2023-11-26 10:41:23,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 381 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:23,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:23,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 427 [2023-11-26 10:41:23,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:24,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][385], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 481#(= |#race~isNull_6~0| 0), Black: 460#true, Black: 465#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:24,808 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:41:24,809 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:24,809 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:24,809 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 10:41:24,814 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][385], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 481#(= |#race~isNull_6~0| 0), Black: 460#true, Black: 465#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:24,814 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is not cut-off event [2023-11-26 10:41:24,814 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:24,815 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:24,815 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is not cut-off event [2023-11-26 10:41:24,815 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:24,827 INFO L124 PetriNetUnfolderBase]: 113/3045 cut-off events. [2023-11-26 10:41:24,827 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2023-11-26 10:41:24,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3324 conditions, 3045 events. 113/3045 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 27673 event pairs, 6 based on Foata normal form. 0/2693 useless extension candidates. Maximal degree in co-relation 2886. Up to 87 conditions per place. [2023-11-26 10:41:24,893 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 16 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2023-11-26 10:41:24,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 386 transitions, 899 flow [2023-11-26 10:41:24,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1238 transitions. [2023-11-26 10:41:24,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664324746291959 [2023-11-26 10:41:24,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1238 transitions. [2023-11-26 10:41:24,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1238 transitions. [2023-11-26 10:41:24,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:24,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1238 transitions. [2023-11-26 10:41:24,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:24,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:24,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:24,909 INFO L175 Difference]: Start difference. First operand has 374 places, 381 transitions, 848 flow. Second operand 3 states and 1238 transitions. [2023-11-26 10:41:24,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 386 transitions, 899 flow [2023-11-26 10:41:24,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 386 transitions, 899 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:24,920 INFO L231 Difference]: Finished difference. Result has 375 places, 381 transitions, 858 flow [2023-11-26 10:41:24,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=375, PETRI_TRANSITIONS=381} [2023-11-26 10:41:24,923 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -13 predicate places. [2023-11-26 10:41:24,923 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 381 transitions, 858 flow [2023-11-26 10:41:24,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:24,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:24,924 INFO L208 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] [2023-11-26 10:41:24,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:41:24,924 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:24,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 620311486, now seen corresponding path program 1 times [2023-11-26 10:41:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557102180] [2023-11-26 10:41:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:24,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:24,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557102180] [2023-11-26 10:41:24,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557102180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:24,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925476642] [2023-11-26 10:41:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:24,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:24,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:25,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 427 [2023-11-26 10:41:25,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 381 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:25,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:25,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 427 [2023-11-26 10:41:25,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:26,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][366], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), 494#true, Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, Black: 465#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:26,360 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:41:26,360 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:26,360 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 10:41:26,360 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:26,361 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][366], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 494#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, Black: 465#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:26,361 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is not cut-off event [2023-11-26 10:41:26,361 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:26,362 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:26,362 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is not cut-off event [2023-11-26 10:41:26,362 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:26,373 INFO L124 PetriNetUnfolderBase]: 226/4799 cut-off events. [2023-11-26 10:41:26,373 INFO L125 PetriNetUnfolderBase]: For 62/157 co-relation queries the response was YES. [2023-11-26 10:41:26,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5431 conditions, 4799 events. 226/4799 cut-off events. For 62/157 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 48980 event pairs, 40 based on Foata normal form. 6/4252 useless extension candidates. Maximal degree in co-relation 4657. Up to 156 conditions per place. [2023-11-26 10:41:26,455 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2023-11-26 10:41:26,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 382 transitions, 888 flow [2023-11-26 10:41:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2023-11-26 10:41:26,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640905542544886 [2023-11-26 10:41:26,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2023-11-26 10:41:26,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2023-11-26 10:41:26,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:26,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2023-11-26 10:41:26,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:26,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:26,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:26,473 INFO L175 Difference]: Start difference. First operand has 375 places, 381 transitions, 858 flow. Second operand 3 states and 1235 transitions. [2023-11-26 10:41:26,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 382 transitions, 888 flow [2023-11-26 10:41:26,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 382 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:26,483 INFO L231 Difference]: Finished difference. Result has 376 places, 380 transitions, 860 flow [2023-11-26 10:41:26,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=376, PETRI_TRANSITIONS=380} [2023-11-26 10:41:26,484 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -12 predicate places. [2023-11-26 10:41:26,485 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 380 transitions, 860 flow [2023-11-26 10:41:26,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:26,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:26,486 INFO L208 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] [2023-11-26 10:41:26,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:41:26,486 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:26,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -475619398, now seen corresponding path program 1 times [2023-11-26 10:41:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442184230] [2023-11-26 10:41:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442184230] [2023-11-26 10:41:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442184230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568851882] [2023-11-26 10:41:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:26,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:26,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2023-11-26 10:41:26,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 380 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:26,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:26,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2023-11-26 10:41:26,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:28,270 INFO L124 PetriNetUnfolderBase]: 471/7643 cut-off events. [2023-11-26 10:41:28,271 INFO L125 PetriNetUnfolderBase]: For 145/153 co-relation queries the response was YES. [2023-11-26 10:41:28,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8738 conditions, 7643 events. 471/7643 cut-off events. For 145/153 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 90363 event pairs, 80 based on Foata normal form. 0/6889 useless extension candidates. Maximal degree in co-relation 7816. Up to 624 conditions per place. [2023-11-26 10:41:28,412 INFO L140 encePairwiseOnDemand]: 419/427 looper letters, 19 selfloop transitions, 4 changer transitions 0/384 dead transitions. [2023-11-26 10:41:28,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 384 transitions, 918 flow [2023-11-26 10:41:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1227 transitions. [2023-11-26 10:41:28,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9578454332552693 [2023-11-26 10:41:28,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1227 transitions. [2023-11-26 10:41:28,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1227 transitions. [2023-11-26 10:41:28,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:28,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1227 transitions. [2023-11-26 10:41:28,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.0) internal successors, (1227), 3 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:28,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:28,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:28,434 INFO L175 Difference]: Start difference. First operand has 376 places, 380 transitions, 860 flow. Second operand 3 states and 1227 transitions. [2023-11-26 10:41:28,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 384 transitions, 918 flow [2023-11-26 10:41:28,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 384 transitions, 914 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:28,451 INFO L231 Difference]: Finished difference. Result has 373 places, 380 transitions, 876 flow [2023-11-26 10:41:28,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=373, PETRI_TRANSITIONS=380} [2023-11-26 10:41:28,453 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -15 predicate places. [2023-11-26 10:41:28,453 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 380 transitions, 876 flow [2023-11-26 10:41:28,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:28,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:28,454 INFO L208 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] [2023-11-26 10:41:28,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:41:28,455 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:28,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash 376785777, now seen corresponding path program 1 times [2023-11-26 10:41:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:28,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680756240] [2023-11-26 10:41:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:29,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:29,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680756240] [2023-11-26 10:41:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680756240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:29,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454344033] [2023-11-26 10:41:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:29,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:29,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 427 [2023-11-26 10:41:29,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 380 transitions, 876 flow. Second operand has 6 states, 6 states have (on average 404.6666666666667) internal successors, (2428), 6 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:29,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:29,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 427 [2023-11-26 10:41:29,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:30,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [326#L80-7true, Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), 484#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 460#true, 489#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:30,742 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-26 10:41:30,743 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:41:30,743 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:41:30,743 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-26 10:41:30,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:30,755 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:41:30,755 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:30,755 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 10:41:30,755 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:30,756 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:30,756 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2023-11-26 10:41:30,756 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:30,756 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 10:41:30,756 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:30,756 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:30,758 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:30,758 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:41:30,758 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:30,758 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 10:41:30,759 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:30,759 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-26 10:41:30,759 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:30,767 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:30,767 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is not cut-off event [2023-11-26 10:41:30,768 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:30,768 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is not cut-off event [2023-11-26 10:41:30,768 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:30,768 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2023-11-26 10:41:30,768 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:30,768 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:30,775 INFO L124 PetriNetUnfolderBase]: 130/3439 cut-off events. [2023-11-26 10:41:30,776 INFO L125 PetriNetUnfolderBase]: For 35/77 co-relation queries the response was YES. [2023-11-26 10:41:30,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 3439 events. 130/3439 cut-off events. For 35/77 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32494 event pairs, 0 based on Foata normal form. 24/3096 useless extension candidates. Maximal degree in co-relation 3358. Up to 92 conditions per place. [2023-11-26 10:41:30,848 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 9 selfloop transitions, 4 changer transitions 0/379 dead transitions. [2023-11-26 10:41:30,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 379 transitions, 900 flow [2023-11-26 10:41:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:41:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:41:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2432 transitions. [2023-11-26 10:41:30,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9492583918813428 [2023-11-26 10:41:30,859 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2432 transitions. [2023-11-26 10:41:30,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2432 transitions. [2023-11-26 10:41:30,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:30,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2432 transitions. [2023-11-26 10:41:30,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 405.3333333333333) internal successors, (2432), 6 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:30,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:30,880 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:30,880 INFO L175 Difference]: Start difference. First operand has 373 places, 380 transitions, 876 flow. Second operand 6 states and 2432 transitions. [2023-11-26 10:41:30,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 379 transitions, 900 flow [2023-11-26 10:41:30,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 379 transitions, 900 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:30,892 INFO L231 Difference]: Finished difference. Result has 377 places, 379 transitions, 882 flow [2023-11-26 10:41:30,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=882, PETRI_PLACES=377, PETRI_TRANSITIONS=379} [2023-11-26 10:41:30,894 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -11 predicate places. [2023-11-26 10:41:30,894 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 379 transitions, 882 flow [2023-11-26 10:41:30,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.6666666666667) internal successors, (2428), 6 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:30,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:30,896 INFO L208 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] [2023-11-26 10:41:30,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:41:30,897 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:30,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1830684488, now seen corresponding path program 1 times [2023-11-26 10:41:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353910089] [2023-11-26 10:41:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353910089] [2023-11-26 10:41:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353910089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881149896] [2023-11-26 10:41:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:30,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:30,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 427 [2023-11-26 10:41:30,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 379 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 409.0) internal successors, (1227), 3 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:30,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:30,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 427 [2023-11-26 10:41:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:31,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1116] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][224], [Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), 484#true, 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), 211#L79-7true, Black: 460#true, 489#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 92#L56-40true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:31,891 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2023-11-26 10:41:31,891 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-26 10:41:31,891 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2023-11-26 10:41:31,891 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-26 10:41:31,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 92#L56-40true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:31,992 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2023-11-26 10:41:31,993 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:31,993 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 10:41:31,993 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:31,999 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 211#L79-7true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 92#L56-40true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:31,999 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-26 10:41:31,999 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 10:41:32,000 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,000 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 10:41:32,000 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,001 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 211#L79-7true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 92#L56-40true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,001 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-11-26 10:41:32,001 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,002 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 10:41:32,002 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,002 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-11-26 10:41:32,002 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 213#L56-41true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 512#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,008 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-26 10:41:32,008 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:32,008 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:32,009 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-11-26 10:41:32,010 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 213#L56-41true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 512#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,010 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2023-11-26 10:41:32,010 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:32,010 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:32,011 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:32,011 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-11-26 10:41:32,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 221#L56-42true, 512#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,017 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2023-11-26 10:41:32,017 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:41:32,017 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-11-26 10:41:32,017 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:41:32,018 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 221#L56-42true, 512#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,018 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2023-11-26 10:41:32,019 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:41:32,019 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-11-26 10:41:32,019 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-26 10:41:32,019 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:41:32,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1116] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][224], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 92#L56-40true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,035 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-11-26 10:41:32,035 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,035 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,036 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,036 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1116] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][224], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 92#L56-40true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,036 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,036 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-26 10:41:32,036 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,037 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,037 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,037 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1116] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][224], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 92#L56-40true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,037 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2023-11-26 10:41:32,038 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-26 10:41:32,038 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,038 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,038 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:41:32,038 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), 159#L58true, Black: 489#true, 211#L79-7true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,042 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2023-11-26 10:41:32,042 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,042 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,042 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-26 10:41:32,043 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), 159#L58true, Black: 489#true, 211#L79-7true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,043 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2023-11-26 10:41:32,044 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,044 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,044 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-26 10:41:32,044 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-26 10:41:32,060 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1116] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][224], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 92#L56-40true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,061 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is not cut-off event [2023-11-26 10:41:32,061 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is not cut-off event [2023-11-26 10:41:32,061 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is not cut-off event [2023-11-26 10:41:32,061 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is not cut-off event [2023-11-26 10:41:32,061 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is not cut-off event [2023-11-26 10:41:32,061 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is not cut-off event [2023-11-26 10:41:32,062 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is not cut-off event [2023-11-26 10:41:32,062 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 213#L56-41true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 211#L79-7true, Black: 460#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 512#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,062 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2023-11-26 10:41:32,062 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:32,062 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2023-11-26 10:41:32,063 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:32,063 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:32,063 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-11-26 10:41:32,065 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 221#L56-42true, 512#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,066 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2023-11-26 10:41:32,066 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:41:32,066 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-11-26 10:41:32,066 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-26 10:41:32,066 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2023-11-26 10:41:32,066 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:41:32,074 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 510#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 159#L58true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 211#L79-7true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:32,074 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-11-26 10:41:32,074 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,074 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:41:32,075 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-11-26 10:41:32,075 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-26 10:41:32,075 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2023-11-26 10:41:32,094 INFO L124 PetriNetUnfolderBase]: 375/4234 cut-off events. [2023-11-26 10:41:32,094 INFO L125 PetriNetUnfolderBase]: For 259/283 co-relation queries the response was YES. [2023-11-26 10:41:32,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5305 conditions, 4234 events. 375/4234 cut-off events. For 259/283 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 44310 event pairs, 82 based on Foata normal form. 0/3827 useless extension candidates. Maximal degree in co-relation 5172. Up to 398 conditions per place. [2023-11-26 10:41:32,200 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2023-11-26 10:41:32,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 380 transitions, 912 flow [2023-11-26 10:41:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2023-11-26 10:41:32,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640905542544886 [2023-11-26 10:41:32,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2023-11-26 10:41:32,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2023-11-26 10:41:32,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:32,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2023-11-26 10:41:32,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:32,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:32,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:32,216 INFO L175 Difference]: Start difference. First operand has 377 places, 379 transitions, 882 flow. Second operand 3 states and 1235 transitions. [2023-11-26 10:41:32,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 380 transitions, 912 flow [2023-11-26 10:41:32,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 380 transitions, 905 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:41:32,225 INFO L231 Difference]: Finished difference. Result has 374 places, 378 transitions, 877 flow [2023-11-26 10:41:32,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=374, PETRI_TRANSITIONS=378} [2023-11-26 10:41:32,227 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -14 predicate places. [2023-11-26 10:41:32,227 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 378 transitions, 877 flow [2023-11-26 10:41:32,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.0) internal successors, (1227), 3 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:32,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:32,228 INFO L208 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] [2023-11-26 10:41:32,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 10:41:32,229 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:32,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1103321674, now seen corresponding path program 1 times [2023-11-26 10:41:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:32,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064498038] [2023-11-26 10:41:32,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064498038] [2023-11-26 10:41:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064498038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:32,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:32,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:32,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727833479] [2023-11-26 10:41:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:32,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:32,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:32,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:32,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 427 [2023-11-26 10:41:32,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 378 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:32,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:32,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 427 [2023-11-26 10:41:32,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:33,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][365], [326#L80-7true, Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), 484#true, 510#true, Black: 455#true, 467#(= |#race~filename_2~0| 0), 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), 514#true, Black: 460#true, 489#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:33,577 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-26 10:41:33,577 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:41:33,577 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-26 10:41:33,577 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:41:33,653 INFO L124 PetriNetUnfolderBase]: 252/5776 cut-off events. [2023-11-26 10:41:33,653 INFO L125 PetriNetUnfolderBase]: For 93/99 co-relation queries the response was YES. [2023-11-26 10:41:33,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6660 conditions, 5776 events. 252/5776 cut-off events. For 93/99 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 61755 event pairs, 22 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 6229. Up to 304 conditions per place. [2023-11-26 10:41:33,720 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 15 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2023-11-26 10:41:33,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 382 transitions, 923 flow [2023-11-26 10:41:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2023-11-26 10:41:33,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9656518345042935 [2023-11-26 10:41:33,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1237 transitions. [2023-11-26 10:41:33,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1237 transitions. [2023-11-26 10:41:33,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:33,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1237 transitions. [2023-11-26 10:41:33,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:33,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:33,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:33,738 INFO L175 Difference]: Start difference. First operand has 374 places, 378 transitions, 877 flow. Second operand 3 states and 1237 transitions. [2023-11-26 10:41:33,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 382 transitions, 923 flow [2023-11-26 10:41:33,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 382 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:33,757 INFO L231 Difference]: Finished difference. Result has 373 places, 378 transitions, 883 flow [2023-11-26 10:41:33,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=883, PETRI_PLACES=373, PETRI_TRANSITIONS=378} [2023-11-26 10:41:33,759 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -15 predicate places. [2023-11-26 10:41:33,759 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 378 transitions, 883 flow [2023-11-26 10:41:33,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:33,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:33,760 INFO L208 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] [2023-11-26 10:41:33,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 10:41:33,760 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:33,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:33,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1781853435, now seen corresponding path program 1 times [2023-11-26 10:41:33,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:33,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794738647] [2023-11-26 10:41:33,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:34,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794738647] [2023-11-26 10:41:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794738647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:34,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:34,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919882812] [2023-11-26 10:41:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:34,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 427 [2023-11-26 10:41:34,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 378 transitions, 883 flow. Second operand has 6 states, 6 states have (on average 404.8333333333333) internal successors, (2429), 6 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:34,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:34,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 427 [2023-11-26 10:41:34,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:35,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [326#L80-7true, Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), 484#true, Black: 455#true, 467#(= |#race~filename_2~0| 0), 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), 514#true, Black: 460#true, 489#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:35,824 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-26 10:41:35,824 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:41:35,825 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:41:35,825 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-26 10:41:35,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:35,847 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-26 10:41:35,847 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:35,847 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:35,847 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:35,847 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:35,847 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-26 10:41:35,848 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:35,848 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:35,848 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:35,848 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-26 10:41:35,848 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:35,848 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:41:35,848 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:35,849 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:35,849 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:35,849 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-26 10:41:35,849 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:35,850 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), Black: 455#true, 467#(= |#race~filename_2~0| 0), 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:35,850 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-26 10:41:35,850 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:35,850 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:35,850 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:35,850 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is not cut-off event [2023-11-26 10:41:35,850 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:35,850 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:35,853 INFO L124 PetriNetUnfolderBase]: 141/3742 cut-off events. [2023-11-26 10:41:35,853 INFO L125 PetriNetUnfolderBase]: For 32/64 co-relation queries the response was YES. [2023-11-26 10:41:35,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 3742 events. 141/3742 cut-off events. For 32/64 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 35886 event pairs, 0 based on Foata normal form. 16/3475 useless extension candidates. Maximal degree in co-relation 4096. Up to 95 conditions per place. [2023-11-26 10:41:35,913 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 9 selfloop transitions, 4 changer transitions 0/377 dead transitions. [2023-11-26 10:41:35,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 377 transitions, 907 flow [2023-11-26 10:41:35,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:41:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:41:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2432 transitions. [2023-11-26 10:41:35,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9492583918813428 [2023-11-26 10:41:35,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2432 transitions. [2023-11-26 10:41:35,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2432 transitions. [2023-11-26 10:41:35,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:35,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2432 transitions. [2023-11-26 10:41:35,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 405.3333333333333) internal successors, (2432), 6 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:35,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:35,944 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:35,944 INFO L175 Difference]: Start difference. First operand has 373 places, 378 transitions, 883 flow. Second operand 6 states and 2432 transitions. [2023-11-26 10:41:35,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 377 transitions, 907 flow [2023-11-26 10:41:35,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 377 transitions, 907 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:35,954 INFO L231 Difference]: Finished difference. Result has 377 places, 377 transitions, 889 flow [2023-11-26 10:41:35,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=889, PETRI_PLACES=377, PETRI_TRANSITIONS=377} [2023-11-26 10:41:35,955 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -11 predicate places. [2023-11-26 10:41:35,955 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 377 transitions, 889 flow [2023-11-26 10:41:35,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.8333333333333) internal successors, (2429), 6 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:35,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:35,957 INFO L208 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] [2023-11-26 10:41:35,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-26 10:41:35,957 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:35,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash -545997193, now seen corresponding path program 1 times [2023-11-26 10:41:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:35,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611600834] [2023-11-26 10:41:35,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:36,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611600834] [2023-11-26 10:41:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611600834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249095188] [2023-11-26 10:41:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:36,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:36,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:36,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:37,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 427 [2023-11-26 10:41:37,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 377 transitions, 889 flow. Second operand has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:37,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:37,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 427 [2023-11-26 10:41:37,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:37,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [326#L80-7true, Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), 484#true, Black: 455#true, 467#(= |#race~filename_2~0| 0), 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), 514#true, Black: 460#true, 489#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:37,748 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-26 10:41:37,749 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:41:37,749 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-26 10:41:37,749 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:41:37,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:37,793 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-26 10:41:37,793 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:37,794 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:37,795 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:37,795 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:37,795 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:41:37,796 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:37,796 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:37,796 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:37,797 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:37,797 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:37,798 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-26 10:41:37,798 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:37,798 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:37,798 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:37,798 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:37,799 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:37,800 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), Black: 455#true, 467#(= |#race~filename_2~0| 0), 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:37,800 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-26 10:41:37,800 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:37,800 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:37,801 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:37,801 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is not cut-off event [2023-11-26 10:41:37,801 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:37,801 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:37,805 INFO L124 PetriNetUnfolderBase]: 141/3733 cut-off events. [2023-11-26 10:41:37,805 INFO L125 PetriNetUnfolderBase]: For 14/36 co-relation queries the response was YES. [2023-11-26 10:41:37,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4262 conditions, 3733 events. 141/3733 cut-off events. For 14/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 35805 event pairs, 0 based on Foata normal form. 8/3467 useless extension candidates. Maximal degree in co-relation 4129. Up to 95 conditions per place. [2023-11-26 10:41:37,895 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 9 selfloop transitions, 4 changer transitions 0/376 dead transitions. [2023-11-26 10:41:37,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 913 flow [2023-11-26 10:41:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:41:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:41:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2432 transitions. [2023-11-26 10:41:37,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9492583918813428 [2023-11-26 10:41:37,907 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2432 transitions. [2023-11-26 10:41:37,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2432 transitions. [2023-11-26 10:41:37,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:37,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2432 transitions. [2023-11-26 10:41:37,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 405.3333333333333) internal successors, (2432), 6 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:37,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:37,929 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 427.0) internal successors, (2989), 7 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:37,929 INFO L175 Difference]: Start difference. First operand has 377 places, 377 transitions, 889 flow. Second operand 6 states and 2432 transitions. [2023-11-26 10:41:37,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 913 flow [2023-11-26 10:41:37,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 376 transitions, 906 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:41:37,942 INFO L231 Difference]: Finished difference. Result has 377 places, 376 transitions, 888 flow [2023-11-26 10:41:37,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=888, PETRI_PLACES=377, PETRI_TRANSITIONS=376} [2023-11-26 10:41:37,943 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -11 predicate places. [2023-11-26 10:41:37,944 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 376 transitions, 888 flow [2023-11-26 10:41:37,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:37,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:37,946 INFO L208 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] [2023-11-26 10:41:37,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 10:41:37,946 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:37,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:37,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1156327131, now seen corresponding path program 1 times [2023-11-26 10:41:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:37,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144297187] [2023-11-26 10:41:37,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:38,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144297187] [2023-11-26 10:41:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144297187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:38,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:38,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:38,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590395322] [2023-11-26 10:41:38,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:38,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:38,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:38,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:38,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 427 [2023-11-26 10:41:38,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 376 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:38,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:38,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 427 [2023-11-26 10:41:38,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:39,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 533#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:39,051 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-26 10:41:39,051 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:41:39,051 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:39,051 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:41:39,052 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 533#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), Black: 455#true, 467#(= |#race~filename_2~0| 0), 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, Black: 460#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:39,052 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-26 10:41:39,052 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:39,053 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:39,053 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:39,053 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:39,056 INFO L124 PetriNetUnfolderBase]: 201/5242 cut-off events. [2023-11-26 10:41:39,056 INFO L125 PetriNetUnfolderBase]: For 34/50 co-relation queries the response was YES. [2023-11-26 10:41:39,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 5242 events. 201/5242 cut-off events. For 34/50 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 54869 event pairs, 6 based on Foata normal form. 0/4892 useless extension candidates. Maximal degree in co-relation 5669. Up to 140 conditions per place. [2023-11-26 10:41:39,135 INFO L140 encePairwiseOnDemand]: 425/427 looper letters, 8 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2023-11-26 10:41:39,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 375 transitions, 904 flow [2023-11-26 10:41:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2023-11-26 10:41:39,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9656518345042935 [2023-11-26 10:41:39,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1237 transitions. [2023-11-26 10:41:39,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1237 transitions. [2023-11-26 10:41:39,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:39,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1237 transitions. [2023-11-26 10:41:39,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:39,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:39,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:39,149 INFO L175 Difference]: Start difference. First operand has 377 places, 376 transitions, 888 flow. Second operand 3 states and 1237 transitions. [2023-11-26 10:41:39,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 375 transitions, 904 flow [2023-11-26 10:41:39,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 375 transitions, 897 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:41:39,161 INFO L231 Difference]: Finished difference. Result has 374 places, 375 transitions, 881 flow [2023-11-26 10:41:39,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=881, PETRI_PLACES=374, PETRI_TRANSITIONS=375} [2023-11-26 10:41:39,163 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -14 predicate places. [2023-11-26 10:41:39,163 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 375 transitions, 881 flow [2023-11-26 10:41:39,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:39,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:39,164 INFO L208 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] [2023-11-26 10:41:39,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-26 10:41:39,165 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:39,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1940961609, now seen corresponding path program 1 times [2023-11-26 10:41:39,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:39,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215599543] [2023-11-26 10:41:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:39,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215599543] [2023-11-26 10:41:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215599543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:39,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503840707] [2023-11-26 10:41:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:39,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:39,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:39,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 427 [2023-11-26 10:41:39,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 375 transitions, 881 flow. Second operand has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:39,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:39,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 427 [2023-11-26 10:41:39,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:40,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [326#L80-7true, 486#(= |#race~filename_1~0| 0), Black: 479#true, 533#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), Black: 455#true, 467#(= |#race~filename_2~0| 0), 481#(= |#race~isNull_6~0| 0), 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 489#true, Black: 460#true, 537#true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:40,581 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-26 10:41:40,581 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:40,582 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:41:40,582 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:41:40,586 INFO L124 PetriNetUnfolderBase]: 199/5849 cut-off events. [2023-11-26 10:41:40,586 INFO L125 PetriNetUnfolderBase]: For 42/76 co-relation queries the response was YES. [2023-11-26 10:41:40,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6680 conditions, 5849 events. 199/5849 cut-off events. For 42/76 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 62815 event pairs, 23 based on Foata normal form. 0/5473 useless extension candidates. Maximal degree in co-relation 6440. Up to 158 conditions per place. [2023-11-26 10:41:40,686 INFO L140 encePairwiseOnDemand]: 425/427 looper letters, 8 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2023-11-26 10:41:40,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 374 transitions, 897 flow [2023-11-26 10:41:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2023-11-26 10:41:40,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9656518345042935 [2023-11-26 10:41:40,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1237 transitions. [2023-11-26 10:41:40,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1237 transitions. [2023-11-26 10:41:40,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:40,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1237 transitions. [2023-11-26 10:41:40,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:40,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:40,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:40,705 INFO L175 Difference]: Start difference. First operand has 374 places, 375 transitions, 881 flow. Second operand 3 states and 1237 transitions. [2023-11-26 10:41:40,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 374 transitions, 897 flow [2023-11-26 10:41:40,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 374 transitions, 896 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:41:40,719 INFO L231 Difference]: Finished difference. Result has 374 places, 374 transitions, 880 flow [2023-11-26 10:41:40,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=374, PETRI_TRANSITIONS=374} [2023-11-26 10:41:40,721 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -14 predicate places. [2023-11-26 10:41:40,721 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 374 transitions, 880 flow [2023-11-26 10:41:40,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:40,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:40,723 INFO L208 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] [2023-11-26 10:41:40,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-26 10:41:40,723 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-26 10:41:40,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -550862490, now seen corresponding path program 1 times [2023-11-26 10:41:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:40,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630014267] [2023-11-26 10:41:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630014267] [2023-11-26 10:41:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630014267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789451104] [2023-11-26 10:41:40,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:40,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:40,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 427 [2023-11-26 10:41:40,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 374 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:40,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:40,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 427 [2023-11-26 10:41:40,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:41,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1120] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [Black: 479#true, 462#(= |#race~isNull_3~0| 0), 457#(= |#race~isNull_0~0| 0), 213#L56-41true, 484#true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), 514#true, 537#true, Black: 460#true, 211#L79-7true, 489#true, 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 541#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:41,882 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2023-11-26 10:41:41,882 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2023-11-26 10:41:41,882 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2023-11-26 10:41:41,883 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-26 10:41:42,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1120] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 213#L56-41true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 537#true, Black: 460#true, 211#L79-7true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 541#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:42,007 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,008 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,008 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,008 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,056 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1120] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 213#L56-41true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 537#true, Black: 460#true, 211#L79-7true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 541#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:42,056 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-26 10:41:42,056 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,056 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,056 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,057 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,057 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1120] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 213#L56-41true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 537#true, Black: 460#true, 211#L79-7true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 541#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:42,057 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,058 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,058 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,058 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,058 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,059 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-26 10:41:42,059 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1120] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 213#L56-41true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 537#true, Black: 460#true, 211#L79-7true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 541#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:42,059 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,060 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,060 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,060 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,060 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,061 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2023-11-26 10:41:42,061 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][347], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 213#L56-41true, 491#(= |#race~filename_4~0| 0), 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 537#true, Black: 460#true, 211#L79-7true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 541#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:42,065 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,065 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,065 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:41:42,065 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:41:42,082 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1185] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][347], [486#(= |#race~filename_1~0| 0), Black: 479#true, 462#(= |#race~isNull_3~0| 0), Black: 514#true, 457#(= |#race~isNull_0~0| 0), Black: 484#true, 491#(= |#race~filename_4~0| 0), 213#L56-41true, 467#(= |#race~filename_2~0| 0), Black: 455#true, 508#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 481#(= |#race~isNull_6~0| 0), Black: 489#true, 537#true, Black: 460#true, 211#L79-7true, 516#(= |#race~filename_7~0| 0), 500#(= |#race~filename_8~0| 0), Black: 465#true, Black: 498#true, 541#true, 524#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 474#true, 476#(= |#race~filename_5~0| 0)]) [2023-11-26 10:41:42,082 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is not cut-off event [2023-11-26 10:41:42,083 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2023-11-26 10:41:42,083 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2023-11-26 10:41:42,083 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2023-11-26 10:41:42,083 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2023-11-26 10:41:42,090 INFO L124 PetriNetUnfolderBase]: 199/4215 cut-off events. [2023-11-26 10:41:42,091 INFO L125 PetriNetUnfolderBase]: For 88/106 co-relation queries the response was YES. [2023-11-26 10:41:42,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 4215 events. 199/4215 cut-off events. For 88/106 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 42257 event pairs, 48 based on Foata normal form. 24/3936 useless extension candidates. Maximal degree in co-relation 4867. Up to 239 conditions per place. [2023-11-26 10:41:42,172 INFO L140 encePairwiseOnDemand]: 425/427 looper letters, 0 selfloop transitions, 0 changer transitions 373/373 dead transitions. [2023-11-26 10:41:42,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 373 transitions, 894 flow [2023-11-26 10:41:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2023-11-26 10:41:42,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9648711943793911 [2023-11-26 10:41:42,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1236 transitions. [2023-11-26 10:41:42,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1236 transitions. [2023-11-26 10:41:42,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:42,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1236 transitions. [2023-11-26 10:41:42,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:42,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:42,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:42,188 INFO L175 Difference]: Start difference. First operand has 374 places, 374 transitions, 880 flow. Second operand 3 states and 1236 transitions. [2023-11-26 10:41:42,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 373 transitions, 894 flow [2023-11-26 10:41:42,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 373 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:41:42,199 INFO L231 Difference]: Finished difference. Result has 374 places, 0 transitions, 0 flow [2023-11-26 10:41:42,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=374, PETRI_TRANSITIONS=0} [2023-11-26 10:41:42,201 INFO L281 CegarLoopForPetriNet]: 388 programPoint places, -14 predicate places. [2023-11-26 10:41:42,201 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 0 transitions, 0 flow [2023-11-26 10:41:42,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:42,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2023-11-26 10:41:42,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2023-11-26 10:41:42,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2023-11-26 10:41:42,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2023-11-26 10:41:42,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2023-11-26 10:41:42,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2023-11-26 10:41:42,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2023-11-26 10:41:42,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2023-11-26 10:41:42,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2023-11-26 10:41:42,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2023-11-26 10:41:42,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2023-11-26 10:41:42,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2023-11-26 10:41:42,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2023-11-26 10:41:42,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2023-11-26 10:41:42,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2023-11-26 10:41:42,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2023-11-26 10:41:42,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2023-11-26 10:41:42,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2023-11-26 10:41:42,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2023-11-26 10:41:42,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2023-11-26 10:41:42,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2023-11-26 10:41:42,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2023-11-26 10:41:42,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2023-11-26 10:41:42,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2023-11-26 10:41:42,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2023-11-26 10:41:42,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2023-11-26 10:41:42,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2023-11-26 10:41:42,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2023-11-26 10:41:42,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2023-11-26 10:41:42,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2023-11-26 10:41:42,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2023-11-26 10:41:42,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2023-11-26 10:41:42,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2023-11-26 10:41:42,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2023-11-26 10:41:42,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2023-11-26 10:41:42,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2023-11-26 10:41:42,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2023-11-26 10:41:42,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2023-11-26 10:41:42,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2023-11-26 10:41:42,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2023-11-26 10:41:42,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2023-11-26 10:41:42,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2023-11-26 10:41:42,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2023-11-26 10:41:42,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2023-11-26 10:41:42,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 72 remaining) [2023-11-26 10:41:42,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2023-11-26 10:41:42,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2023-11-26 10:41:42,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2023-11-26 10:41:42,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2023-11-26 10:41:42,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2023-11-26 10:41:42,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2023-11-26 10:41:42,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2023-11-26 10:41:42,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2023-11-26 10:41:42,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2023-11-26 10:41:42,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2023-11-26 10:41:42,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2023-11-26 10:41:42,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2023-11-26 10:41:42,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2023-11-26 10:41:42,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2023-11-26 10:41:42,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2023-11-26 10:41:42,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2023-11-26 10:41:42,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2023-11-26 10:41:42,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2023-11-26 10:41:42,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2023-11-26 10:41:42,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2023-11-26 10:41:42,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2023-11-26 10:41:42,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2023-11-26 10:41:42,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2023-11-26 10:41:42,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2023-11-26 10:41:42,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2023-11-26 10:41:42,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2023-11-26 10:41:42,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2023-11-26 10:41:42,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-26 10:41:42,227 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-26 10:41:42,235 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:41:42,236 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:41:42,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:41:42 BasicIcfg [2023-11-26 10:41:42,243 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:41:42,244 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:41:42,244 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:41:42,245 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:41:42,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:14" (3/4) ... [2023-11-26 10:41:42,248 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 10:41:42,253 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-26 10:41:42,253 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-26 10:41:42,254 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-26 10:41:42,265 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-26 10:41:42,266 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-26 10:41:42,266 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 10:41:42,267 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 10:41:42,440 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:41:42,440 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 10:41:42,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:41:42,442 INFO L158 Benchmark]: Toolchain (without parser) took 30170.58ms. Allocated memory was 178.3MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 134.0MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-26 10:41:42,442 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:41:42,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.17ms. Allocated memory is still 178.3MB. Free memory was 134.0MB in the beginning and 121.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:41:42,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.24ms. Allocated memory is still 178.3MB. Free memory was 121.3MB in the beginning and 118.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:41:42,444 INFO L158 Benchmark]: Boogie Preprocessor took 76.28ms. Allocated memory is still 178.3MB. Free memory was 118.6MB in the beginning and 116.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:42,445 INFO L158 Benchmark]: RCFGBuilder took 1255.15ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 86.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-26 10:41:42,445 INFO L158 Benchmark]: TraceAbstraction took 28170.82ms. Allocated memory was 178.3MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 85.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-26 10:41:42,446 INFO L158 Benchmark]: Witness Printer took 196.83ms. Allocated memory is still 4.7GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 10:41:42,448 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.42ms. Allocated memory is still 117.4MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.17ms. Allocated memory is still 178.3MB. Free memory was 134.0MB in the beginning and 121.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.24ms. Allocated memory is still 178.3MB. Free memory was 121.3MB in the beginning and 118.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.28ms. Allocated memory is still 178.3MB. Free memory was 118.6MB in the beginning and 116.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1255.15ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 86.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28170.82ms. Allocated memory was 178.3MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 85.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 196.83ms. Allocated memory is still 4.7GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: 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: 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: 50]: 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: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 72]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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 7 procedures, 635 locations, 72 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: 27.8s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 697 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1161 IncrementalHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 190 mSDtfsCounter, 1161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=889occurred in iteration=23, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2810 NumberOfCodeBlocks, 2810 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2783 ConstructedInterpolants, 0 QuantifiedInterpolants, 3074 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-26 10:41:42,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd453a2e-f44b-4c4b-a1ea-c01ea50c89df/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE