./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 527bcce2 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_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx --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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:02:23,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:02:23,998 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-21 21:02:24,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:02:24,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:02:24,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:02:24,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:02:24,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:02:24,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:02:24,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:02:24,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:02:24,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:02:24,062 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:02:24,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:02:24,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:02:24,065 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:02:24,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:02:24,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:02:24,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:02:24,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:02:24,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:02:24,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:02:24,068 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 21:02:24,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:02:24,068 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:02:24,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:02:24,069 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:02:24,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:02:24,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:02:24,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:02:24,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:02:24,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:02:24,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:02:24,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:02:24,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:02:24,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:02:24,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:02:24,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:02:24,073 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:02:24,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:02:24,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:02:24,074 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_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/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_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2023-11-21 21:02:24,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:02:24,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:02:24,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:02:24,409 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:02:24,410 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:02:24,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2023-11-21 21:02:27,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:02:27,874 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:02:27,875 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2023-11-21 21:02:27,886 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/data/9552904b8/36a8aac08eea4a4fab8274cb157c2026/FLAGcdab746c7 [2023-11-21 21:02:27,902 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/data/9552904b8/36a8aac08eea4a4fab8274cb157c2026 [2023-11-21 21:02:27,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:02:27,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:02:27,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:02:27,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:02:27,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:02:27,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:02:27" (1/1) ... [2023-11-21 21:02:27,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9eb0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:27, skipping insertion in model container [2023-11-21 21:02:27,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:02:27" (1/1) ... [2023-11-21 21:02:27,963 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:02:28,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:02:28,210 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:02:28,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:02:28,322 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:02:28,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28 WrapperNode [2023-11-21 21:02:28,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:02:28,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:02:28,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:02:28,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:02:28,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,422 INFO L138 Inliner]: procedures = 25, calls = 56, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 905 [2023-11-21 21:02:28,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:02:28,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:02:28,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:02:28,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:02:28,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:02:28,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:02:28,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:02:28,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:02:28,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (1/1) ... [2023-11-21 21:02:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:02:28,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:02:28,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:02:28,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:02:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:02:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:02:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 21:02:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 21:02:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-21 21:02:28,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-21 21:02:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-21 21:02:28,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-21 21:02:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 21:02:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 21:02:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:02:28,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:02:28,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:02:28,660 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 21:02:28,893 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:02:28,896 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:02:30,223 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:02:30,260 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:02:30,260 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 21:02:30,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:02:30 BoogieIcfgContainer [2023-11-21 21:02:30,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:02:30,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:02:30,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:02:30,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:02:30,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:02:27" (1/3) ... [2023-11-21 21:02:30,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cb95c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:02:30, skipping insertion in model container [2023-11-21 21:02:30,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:28" (2/3) ... [2023-11-21 21:02:30,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cb95c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:02:30, skipping insertion in model container [2023-11-21 21:02:30,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:02:30" (3/3) ... [2023-11-21 21:02:30,275 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2023-11-21 21:02:30,288 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 21:02:30,300 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:02:30,300 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 154 error locations. [2023-11-21 21:02:30,300 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 21:02:30,563 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 21:02:30,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1142 places, 1210 transitions, 2434 flow [2023-11-21 21:02:31,589 INFO L124 PetriNetUnfolderBase]: 75/1208 cut-off events. [2023-11-21 21:02:31,590 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-21 21:02:31,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 1208 events. 75/1208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4299 event pairs, 0 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 927. Up to 2 conditions per place. [2023-11-21 21:02:31,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 1142 places, 1210 transitions, 2434 flow [2023-11-21 21:02:31,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1116 places, 1182 transitions, 2376 flow [2023-11-21 21:02:31,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 21:02:31,733 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;@1c12bc53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:02:31,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 288 error locations. [2023-11-21 21:02:31,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 21:02:31,738 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2023-11-21 21:02:31,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 21:02:31,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:31,739 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] [2023-11-21 21:02:31,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:31,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1272888381, now seen corresponding path program 1 times [2023-11-21 21:02:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:31,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652096770] [2023-11-21 21:02:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:32,028 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-21 21:02:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:32,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652096770] [2023-11-21 21:02:32,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652096770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:32,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:32,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937523491] [2023-11-21 21:02:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:32,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:32,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:32,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:32,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1210 [2023-11-21 21:02:32,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1116 places, 1182 transitions, 2376 flow. Second operand has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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-21 21:02:32,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:32,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1210 [2023-11-21 21:02:32,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:33,094 INFO L124 PetriNetUnfolderBase]: 75/1624 cut-off events. [2023-11-21 21:02:33,095 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2023-11-21 21:02:33,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 1624 events. 75/1624 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7147 event pairs, 3 based on Foata normal form. 50/1352 useless extension candidates. Maximal degree in co-relation 1373. Up to 16 conditions per place. [2023-11-21 21:02:33,166 INFO L140 encePairwiseOnDemand]: 1183/1210 looper letters, 9 selfloop transitions, 2 changer transitions 4/1157 dead transitions. [2023-11-21 21:02:33,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1117 places, 1157 transitions, 2348 flow [2023-11-21 21:02:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3549 transitions. [2023-11-21 21:02:33,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9776859504132231 [2023-11-21 21:02:33,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3549 transitions. [2023-11-21 21:02:33,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3549 transitions. [2023-11-21 21:02:33,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:33,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3549 transitions. [2023-11-21 21:02:33,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1183.0) internal successors, (3549), 3 states have internal predecessors, (3549), 0 states have call successors, (0), 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-21 21:02:33,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:33,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:33,261 INFO L175 Difference]: Start difference. First operand has 1116 places, 1182 transitions, 2376 flow. Second operand 3 states and 3549 transitions. [2023-11-21 21:02:33,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1117 places, 1157 transitions, 2348 flow [2023-11-21 21:02:33,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1113 places, 1157 transitions, 2340 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 21:02:33,313 INFO L231 Difference]: Finished difference. Result has 1113 places, 1153 transitions, 2314 flow [2023-11-21 21:02:33,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2318, PETRI_DIFFERENCE_MINUEND_PLACES=1111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2314, PETRI_PLACES=1113, PETRI_TRANSITIONS=1153} [2023-11-21 21:02:33,322 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -3 predicate places. [2023-11-21 21:02:33,323 INFO L495 AbstractCegarLoop]: Abstraction has has 1113 places, 1153 transitions, 2314 flow [2023-11-21 21:02:33,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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-21 21:02:33,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:33,327 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] [2023-11-21 21:02:33,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:02:33,327 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:33,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1113382079, now seen corresponding path program 1 times [2023-11-21 21:02:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607104198] [2023-11-21 21:02:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:33,437 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-21 21:02:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:33,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607104198] [2023-11-21 21:02:33,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607104198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:33,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244656497] [2023-11-21 21:02:33,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:33,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:33,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:33,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1210 [2023-11-21 21:02:33,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1113 places, 1153 transitions, 2314 flow. Second operand has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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-21 21:02:33,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:33,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1210 [2023-11-21 21:02:33,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:34,329 INFO L124 PetriNetUnfolderBase]: 75/1619 cut-off events. [2023-11-21 21:02:34,330 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2023-11-21 21:02:34,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 1619 events. 75/1619 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7411 event pairs, 3 based on Foata normal form. 0/1303 useless extension candidates. Maximal degree in co-relation 1606. Up to 16 conditions per place. [2023-11-21 21:02:34,396 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 9 selfloop transitions, 2 changer transitions 0/1152 dead transitions. [2023-11-21 21:02:34,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1110 places, 1152 transitions, 2334 flow [2023-11-21 21:02:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3525 transitions. [2023-11-21 21:02:34,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9710743801652892 [2023-11-21 21:02:34,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3525 transitions. [2023-11-21 21:02:34,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3525 transitions. [2023-11-21 21:02:34,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:34,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3525 transitions. [2023-11-21 21:02:34,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1175.0) internal successors, (3525), 3 states have internal predecessors, (3525), 0 states have call successors, (0), 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-21 21:02:34,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:34,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:34,441 INFO L175 Difference]: Start difference. First operand has 1113 places, 1153 transitions, 2314 flow. Second operand 3 states and 3525 transitions. [2023-11-21 21:02:34,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1110 places, 1152 transitions, 2334 flow [2023-11-21 21:02:34,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1108 places, 1152 transitions, 2330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:34,468 INFO L231 Difference]: Finished difference. Result has 1108 places, 1152 transitions, 2312 flow [2023-11-21 21:02:34,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=1106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2312, PETRI_PLACES=1108, PETRI_TRANSITIONS=1152} [2023-11-21 21:02:34,471 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -8 predicate places. [2023-11-21 21:02:34,472 INFO L495 AbstractCegarLoop]: Abstraction has has 1108 places, 1152 transitions, 2312 flow [2023-11-21 21:02:34,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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-21 21:02:34,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:34,475 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] [2023-11-21 21:02:34,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:02:34,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:34,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1832690889, now seen corresponding path program 1 times [2023-11-21 21:02:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:34,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875863153] [2023-11-21 21:02:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:34,529 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-21 21:02:34,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875863153] [2023-11-21 21:02:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875863153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824263841] [2023-11-21 21:02:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:34,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:34,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:34,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:34,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1210 [2023-11-21 21:02:34,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1108 places, 1152 transitions, 2312 flow. Second operand has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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-21 21:02:34,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:34,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1210 [2023-11-21 21:02:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:35,336 INFO L124 PetriNetUnfolderBase]: 75/1618 cut-off events. [2023-11-21 21:02:35,337 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2023-11-21 21:02:35,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 1618 events. 75/1618 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7165 event pairs, 3 based on Foata normal form. 0/1302 useless extension candidates. Maximal degree in co-relation 1597. Up to 16 conditions per place. [2023-11-21 21:02:35,411 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 9 selfloop transitions, 2 changer transitions 0/1151 dead transitions. [2023-11-21 21:02:35,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1109 places, 1151 transitions, 2332 flow [2023-11-21 21:02:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3525 transitions. [2023-11-21 21:02:35,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9710743801652892 [2023-11-21 21:02:35,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3525 transitions. [2023-11-21 21:02:35,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3525 transitions. [2023-11-21 21:02:35,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:35,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3525 transitions. [2023-11-21 21:02:35,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1175.0) internal successors, (3525), 3 states have internal predecessors, (3525), 0 states have call successors, (0), 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-21 21:02:35,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:35,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:35,461 INFO L175 Difference]: Start difference. First operand has 1108 places, 1152 transitions, 2312 flow. Second operand 3 states and 3525 transitions. [2023-11-21 21:02:35,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1109 places, 1151 transitions, 2332 flow [2023-11-21 21:02:35,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1107 places, 1151 transitions, 2328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:35,491 INFO L231 Difference]: Finished difference. Result has 1107 places, 1151 transitions, 2310 flow [2023-11-21 21:02:35,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=1105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2310, PETRI_PLACES=1107, PETRI_TRANSITIONS=1151} [2023-11-21 21:02:35,494 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -9 predicate places. [2023-11-21 21:02:35,495 INFO L495 AbstractCegarLoop]: Abstraction has has 1107 places, 1151 transitions, 2310 flow [2023-11-21 21:02:35,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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-21 21:02:35,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:35,498 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] [2023-11-21 21:02:35,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:02:35,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:35,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1003627711, now seen corresponding path program 1 times [2023-11-21 21:02:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594142007] [2023-11-21 21:02:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:35,577 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-21 21:02:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594142007] [2023-11-21 21:02:35,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594142007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:35,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:35,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456828998] [2023-11-21 21:02:35,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:35,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:35,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:35,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1210 [2023-11-21 21:02:35,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1107 places, 1151 transitions, 2310 flow. Second operand has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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-21 21:02:35,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:35,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1210 [2023-11-21 21:02:35,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:36,448 INFO L124 PetriNetUnfolderBase]: 76/1654 cut-off events. [2023-11-21 21:02:36,448 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-21 21:02:36,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1654 events. 76/1654 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7636 event pairs, 3 based on Foata normal form. 0/1335 useless extension candidates. Maximal degree in co-relation 1626. Up to 17 conditions per place. [2023-11-21 21:02:36,510 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 9 selfloop transitions, 2 changer transitions 0/1150 dead transitions. [2023-11-21 21:02:36,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1108 places, 1150 transitions, 2330 flow [2023-11-21 21:02:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3525 transitions. [2023-11-21 21:02:36,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9710743801652892 [2023-11-21 21:02:36,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3525 transitions. [2023-11-21 21:02:36,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3525 transitions. [2023-11-21 21:02:36,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:36,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3525 transitions. [2023-11-21 21:02:36,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1175.0) internal successors, (3525), 3 states have internal predecessors, (3525), 0 states have call successors, (0), 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-21 21:02:36,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:36,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:36,551 INFO L175 Difference]: Start difference. First operand has 1107 places, 1151 transitions, 2310 flow. Second operand 3 states and 3525 transitions. [2023-11-21 21:02:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1108 places, 1150 transitions, 2330 flow [2023-11-21 21:02:36,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1106 places, 1150 transitions, 2326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:36,579 INFO L231 Difference]: Finished difference. Result has 1106 places, 1150 transitions, 2308 flow [2023-11-21 21:02:36,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=1104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2308, PETRI_PLACES=1106, PETRI_TRANSITIONS=1150} [2023-11-21 21:02:36,583 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -10 predicate places. [2023-11-21 21:02:36,583 INFO L495 AbstractCegarLoop]: Abstraction has has 1106 places, 1150 transitions, 2308 flow [2023-11-21 21:02:36,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 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-21 21:02:36,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:36,586 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] [2023-11-21 21:02:36,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:02:36,586 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:36,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 584902917, now seen corresponding path program 1 times [2023-11-21 21:02:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093865873] [2023-11-21 21:02:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:36,692 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-21 21:02:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093865873] [2023-11-21 21:02:36,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093865873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:36,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:36,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:36,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693865734] [2023-11-21 21:02:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:36,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:36,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:36,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:36,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:36,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1162 out of 1210 [2023-11-21 21:02:36,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1106 places, 1150 transitions, 2308 flow. Second operand has 3 states, 3 states have (on average 1163.3333333333333) internal successors, (3490), 3 states have internal predecessors, (3490), 0 states have call successors, (0), 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-21 21:02:36,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:36,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1162 of 1210 [2023-11-21 21:02:36,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:38,398 INFO L124 PetriNetUnfolderBase]: 265/5253 cut-off events. [2023-11-21 21:02:38,398 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-21 21:02:38,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 5253 events. 265/5253 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 38188 event pairs, 9 based on Foata normal form. 0/4150 useless extension candidates. Maximal degree in co-relation 5245. Up to 37 conditions per place. [2023-11-21 21:02:38,502 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 18 selfloop transitions, 2 changer transitions 0/1149 dead transitions. [2023-11-21 21:02:38,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1107 places, 1149 transitions, 2346 flow [2023-11-21 21:02:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3507 transitions. [2023-11-21 21:02:38,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9661157024793389 [2023-11-21 21:02:38,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3507 transitions. [2023-11-21 21:02:38,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3507 transitions. [2023-11-21 21:02:38,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:38,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3507 transitions. [2023-11-21 21:02:38,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1169.0) internal successors, (3507), 3 states have internal predecessors, (3507), 0 states have call successors, (0), 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-21 21:02:38,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:38,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:38,651 INFO L175 Difference]: Start difference. First operand has 1106 places, 1150 transitions, 2308 flow. Second operand 3 states and 3507 transitions. [2023-11-21 21:02:38,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1107 places, 1149 transitions, 2346 flow [2023-11-21 21:02:38,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1105 places, 1149 transitions, 2342 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:38,676 INFO L231 Difference]: Finished difference. Result has 1105 places, 1149 transitions, 2306 flow [2023-11-21 21:02:38,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=1103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2306, PETRI_PLACES=1105, PETRI_TRANSITIONS=1149} [2023-11-21 21:02:38,679 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -11 predicate places. [2023-11-21 21:02:38,679 INFO L495 AbstractCegarLoop]: Abstraction has has 1105 places, 1149 transitions, 2306 flow [2023-11-21 21:02:38,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1163.3333333333333) internal successors, (3490), 3 states have internal predecessors, (3490), 0 states have call successors, (0), 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-21 21:02:38,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:38,681 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] [2023-11-21 21:02:38,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:02:38,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:38,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash 738446062, now seen corresponding path program 1 times [2023-11-21 21:02:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:38,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360763980] [2023-11-21 21:02:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:38,754 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-21 21:02:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360763980] [2023-11-21 21:02:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360763980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:38,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964669587] [2023-11-21 21:02:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:38,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:38,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:38,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:38,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:38,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1158 out of 1210 [2023-11-21 21:02:38,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1105 places, 1149 transitions, 2306 flow. Second operand has 3 states, 3 states have (on average 1159.3333333333333) internal successors, (3478), 3 states have internal predecessors, (3478), 0 states have call successors, (0), 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-21 21:02:38,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:38,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1158 of 1210 [2023-11-21 21:02:38,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:41,092 INFO L124 PetriNetUnfolderBase]: 409/7988 cut-off events. [2023-11-21 21:02:41,092 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-21 21:02:41,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8064 conditions, 7988 events. 409/7988 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 66318 event pairs, 15 based on Foata normal form. 0/6292 useless extension candidates. Maximal degree in co-relation 7994. Up to 53 conditions per place. [2023-11-21 21:02:41,201 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 22 selfloop transitions, 2 changer transitions 0/1148 dead transitions. [2023-11-21 21:02:41,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1106 places, 1148 transitions, 2352 flow [2023-11-21 21:02:41,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3499 transitions. [2023-11-21 21:02:41,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9639118457300275 [2023-11-21 21:02:41,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3499 transitions. [2023-11-21 21:02:41,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3499 transitions. [2023-11-21 21:02:41,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:41,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3499 transitions. [2023-11-21 21:02:41,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:41,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:41,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:41,238 INFO L175 Difference]: Start difference. First operand has 1105 places, 1149 transitions, 2306 flow. Second operand 3 states and 3499 transitions. [2023-11-21 21:02:41,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1106 places, 1148 transitions, 2352 flow [2023-11-21 21:02:41,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1104 places, 1148 transitions, 2348 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:41,262 INFO L231 Difference]: Finished difference. Result has 1104 places, 1148 transitions, 2304 flow [2023-11-21 21:02:41,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=1102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2304, PETRI_PLACES=1104, PETRI_TRANSITIONS=1148} [2023-11-21 21:02:41,268 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -12 predicate places. [2023-11-21 21:02:41,268 INFO L495 AbstractCegarLoop]: Abstraction has has 1104 places, 1148 transitions, 2304 flow [2023-11-21 21:02:41,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1159.3333333333333) internal successors, (3478), 3 states have internal predecessors, (3478), 0 states have call successors, (0), 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-21 21:02:41,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:41,270 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] [2023-11-21 21:02:41,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 21:02:41,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:41,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1446297600, now seen corresponding path program 1 times [2023-11-21 21:02:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056457311] [2023-11-21 21:02:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:41,367 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-21 21:02:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:41,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056457311] [2023-11-21 21:02:41,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056457311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:41,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:41,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147022172] [2023-11-21 21:02:41,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:41,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:41,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:41,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:41,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1162 out of 1210 [2023-11-21 21:02:41,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1104 places, 1148 transitions, 2304 flow. Second operand has 3 states, 3 states have (on average 1163.3333333333333) internal successors, (3490), 3 states have internal predecessors, (3490), 0 states have call successors, (0), 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-21 21:02:41,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:41,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1162 of 1210 [2023-11-21 21:02:41,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:42,043 INFO L124 PetriNetUnfolderBase]: 58/1239 cut-off events. [2023-11-21 21:02:42,044 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2023-11-21 21:02:42,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 1239 events. 58/1239 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5458 event pairs, 9 based on Foata normal form. 0/1015 useless extension candidates. Maximal degree in co-relation 1206. Up to 37 conditions per place. [2023-11-21 21:02:42,100 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 18 selfloop transitions, 2 changer transitions 0/1147 dead transitions. [2023-11-21 21:02:42,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1105 places, 1147 transitions, 2342 flow [2023-11-21 21:02:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3507 transitions. [2023-11-21 21:02:42,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9661157024793389 [2023-11-21 21:02:42,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3507 transitions. [2023-11-21 21:02:42,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3507 transitions. [2023-11-21 21:02:42,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:42,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3507 transitions. [2023-11-21 21:02:42,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1169.0) internal successors, (3507), 3 states have internal predecessors, (3507), 0 states have call successors, (0), 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-21 21:02:42,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:42,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:42,141 INFO L175 Difference]: Start difference. First operand has 1104 places, 1148 transitions, 2304 flow. Second operand 3 states and 3507 transitions. [2023-11-21 21:02:42,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1105 places, 1147 transitions, 2342 flow [2023-11-21 21:02:42,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1103 places, 1147 transitions, 2338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:42,170 INFO L231 Difference]: Finished difference. Result has 1103 places, 1147 transitions, 2302 flow [2023-11-21 21:02:42,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=1101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2302, PETRI_PLACES=1103, PETRI_TRANSITIONS=1147} [2023-11-21 21:02:42,174 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -13 predicate places. [2023-11-21 21:02:42,174 INFO L495 AbstractCegarLoop]: Abstraction has has 1103 places, 1147 transitions, 2302 flow [2023-11-21 21:02:42,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1163.3333333333333) internal successors, (3490), 3 states have internal predecessors, (3490), 0 states have call successors, (0), 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-21 21:02:42,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:42,176 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] [2023-11-21 21:02:42,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 21:02:42,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:42,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2144874012, now seen corresponding path program 1 times [2023-11-21 21:02:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:42,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187797859] [2023-11-21 21:02:42,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:42,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:42,229 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-21 21:02:42,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:42,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187797859] [2023-11-21 21:02:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187797859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:42,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:42,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338590473] [2023-11-21 21:02:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:42,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:42,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:42,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1158 out of 1210 [2023-11-21 21:02:42,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1103 places, 1147 transitions, 2302 flow. Second operand has 3 states, 3 states have (on average 1159.3333333333333) internal successors, (3478), 3 states have internal predecessors, (3478), 0 states have call successors, (0), 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-21 21:02:42,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:42,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1158 of 1210 [2023-11-21 21:02:42,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:43,041 INFO L124 PetriNetUnfolderBase]: 81/1494 cut-off events. [2023-11-21 21:02:43,041 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2023-11-21 21:02:43,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1494 events. 81/1494 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7315 event pairs, 15 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 1470. Up to 54 conditions per place. [2023-11-21 21:02:43,097 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 22 selfloop transitions, 2 changer transitions 0/1146 dead transitions. [2023-11-21 21:02:43,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1104 places, 1146 transitions, 2348 flow [2023-11-21 21:02:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3499 transitions. [2023-11-21 21:02:43,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9639118457300275 [2023-11-21 21:02:43,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3499 transitions. [2023-11-21 21:02:43,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3499 transitions. [2023-11-21 21:02:43,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:43,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3499 transitions. [2023-11-21 21:02:43,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:43,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:43,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:43,130 INFO L175 Difference]: Start difference. First operand has 1103 places, 1147 transitions, 2302 flow. Second operand 3 states and 3499 transitions. [2023-11-21 21:02:43,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1104 places, 1146 transitions, 2348 flow [2023-11-21 21:02:43,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1102 places, 1146 transitions, 2344 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:43,154 INFO L231 Difference]: Finished difference. Result has 1102 places, 1146 transitions, 2300 flow [2023-11-21 21:02:43,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=1100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2300, PETRI_PLACES=1102, PETRI_TRANSITIONS=1146} [2023-11-21 21:02:43,159 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -14 predicate places. [2023-11-21 21:02:43,159 INFO L495 AbstractCegarLoop]: Abstraction has has 1102 places, 1146 transitions, 2300 flow [2023-11-21 21:02:43,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1159.3333333333333) internal successors, (3478), 3 states have internal predecessors, (3478), 0 states have call successors, (0), 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-21 21:02:43,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:43,161 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] [2023-11-21 21:02:43,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:02:43,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:43,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash 912171597, now seen corresponding path program 1 times [2023-11-21 21:02:43,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:43,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841363206] [2023-11-21 21:02:43,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:43,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:43,221 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-21 21:02:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841363206] [2023-11-21 21:02:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841363206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727592760] [2023-11-21 21:02:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:43,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:43,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1165 out of 1210 [2023-11-21 21:02:43,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1102 places, 1146 transitions, 2300 flow. Second operand has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:43,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:43,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1165 of 1210 [2023-11-21 21:02:43,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:44,077 INFO L124 PetriNetUnfolderBase]: 188/3400 cut-off events. [2023-11-21 21:02:44,077 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-21 21:02:44,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3476 conditions, 3400 events. 188/3400 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 24046 event pairs, 24 based on Foata normal form. 0/2696 useless extension candidates. Maximal degree in co-relation 3382. Up to 64 conditions per place. [2023-11-21 21:02:44,139 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 15 selfloop transitions, 2 changer transitions 0/1145 dead transitions. [2023-11-21 21:02:44,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1103 places, 1145 transitions, 2332 flow [2023-11-21 21:02:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-21 21:02:44,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-21 21:02:44,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-21 21:02:44,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-21 21:02:44,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:44,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-21 21:02:44,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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-21 21:02:44,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:44,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:44,176 INFO L175 Difference]: Start difference. First operand has 1102 places, 1146 transitions, 2300 flow. Second operand 3 states and 3513 transitions. [2023-11-21 21:02:44,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1103 places, 1145 transitions, 2332 flow [2023-11-21 21:02:44,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1101 places, 1145 transitions, 2328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:44,207 INFO L231 Difference]: Finished difference. Result has 1101 places, 1145 transitions, 2298 flow [2023-11-21 21:02:44,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2294, PETRI_DIFFERENCE_MINUEND_PLACES=1099, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2298, PETRI_PLACES=1101, PETRI_TRANSITIONS=1145} [2023-11-21 21:02:44,210 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -15 predicate places. [2023-11-21 21:02:44,210 INFO L495 AbstractCegarLoop]: Abstraction has has 1101 places, 1145 transitions, 2298 flow [2023-11-21 21:02:44,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:44,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:44,212 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] [2023-11-21 21:02:44,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 21:02:44,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:44,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1962596976, now seen corresponding path program 1 times [2023-11-21 21:02:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:44,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402673304] [2023-11-21 21:02:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:44,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:44,287 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-21 21:02:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402673304] [2023-11-21 21:02:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402673304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:44,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054923615] [2023-11-21 21:02:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:44,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:44,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1165 out of 1210 [2023-11-21 21:02:44,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1101 places, 1145 transitions, 2298 flow. Second operand has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:44,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:44,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1165 of 1210 [2023-11-21 21:02:44,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:45,248 INFO L124 PetriNetUnfolderBase]: 188/3427 cut-off events. [2023-11-21 21:02:45,248 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-11-21 21:02:45,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 3427 events. 188/3427 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 23982 event pairs, 24 based on Foata normal form. 0/2718 useless extension candidates. Maximal degree in co-relation 3402. Up to 64 conditions per place. [2023-11-21 21:02:45,310 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 15 selfloop transitions, 2 changer transitions 0/1144 dead transitions. [2023-11-21 21:02:45,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1102 places, 1144 transitions, 2330 flow [2023-11-21 21:02:45,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-21 21:02:45,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-21 21:02:45,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-21 21:02:45,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-21 21:02:45,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:45,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-21 21:02:45,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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-21 21:02:45,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:45,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:45,352 INFO L175 Difference]: Start difference. First operand has 1101 places, 1145 transitions, 2298 flow. Second operand 3 states and 3513 transitions. [2023-11-21 21:02:45,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1102 places, 1144 transitions, 2330 flow [2023-11-21 21:02:45,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1100 places, 1144 transitions, 2326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:45,383 INFO L231 Difference]: Finished difference. Result has 1100 places, 1144 transitions, 2296 flow [2023-11-21 21:02:45,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=1098, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2296, PETRI_PLACES=1100, PETRI_TRANSITIONS=1144} [2023-11-21 21:02:45,386 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -16 predicate places. [2023-11-21 21:02:45,387 INFO L495 AbstractCegarLoop]: Abstraction has has 1100 places, 1144 transitions, 2296 flow [2023-11-21 21:02:45,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:45,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:45,389 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] [2023-11-21 21:02:45,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 21:02:45,390 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:45,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1409736677, now seen corresponding path program 1 times [2023-11-21 21:02:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190823387] [2023-11-21 21:02:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:45,452 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-21 21:02:45,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190823387] [2023-11-21 21:02:45,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190823387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:45,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397033479] [2023-11-21 21:02:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:45,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:45,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:45,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1159 out of 1210 [2023-11-21 21:02:45,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1100 places, 1144 transitions, 2296 flow. Second operand has 3 states, 3 states have (on average 1160.3333333333333) internal successors, (3481), 3 states have internal predecessors, (3481), 0 states have call successors, (0), 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-21 21:02:45,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:45,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1159 of 1210 [2023-11-21 21:02:45,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:47,264 INFO L124 PetriNetUnfolderBase]: 385/7527 cut-off events. [2023-11-21 21:02:47,265 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-21 21:02:47,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7599 conditions, 7527 events. 385/7527 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 61827 event pairs, 14 based on Foata normal form. 0/5937 useless extension candidates. Maximal degree in co-relation 7491. Up to 50 conditions per place. [2023-11-21 21:02:47,322 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 21 selfloop transitions, 2 changer transitions 0/1143 dead transitions. [2023-11-21 21:02:47,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1101 places, 1143 transitions, 2340 flow [2023-11-21 21:02:47,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3501 transitions. [2023-11-21 21:02:47,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644628099173553 [2023-11-21 21:02:47,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3501 transitions. [2023-11-21 21:02:47,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3501 transitions. [2023-11-21 21:02:47,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:47,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3501 transitions. [2023-11-21 21:02:47,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1167.0) internal successors, (3501), 3 states have internal predecessors, (3501), 0 states have call successors, (0), 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-21 21:02:47,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:47,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:47,346 INFO L175 Difference]: Start difference. First operand has 1100 places, 1144 transitions, 2296 flow. Second operand 3 states and 3501 transitions. [2023-11-21 21:02:47,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1101 places, 1143 transitions, 2340 flow [2023-11-21 21:02:47,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1099 places, 1143 transitions, 2336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:47,370 INFO L231 Difference]: Finished difference. Result has 1099 places, 1143 transitions, 2294 flow [2023-11-21 21:02:47,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=1097, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=1099, PETRI_TRANSITIONS=1143} [2023-11-21 21:02:47,373 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -17 predicate places. [2023-11-21 21:02:47,373 INFO L495 AbstractCegarLoop]: Abstraction has has 1099 places, 1143 transitions, 2294 flow [2023-11-21 21:02:47,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1160.3333333333333) internal successors, (3481), 3 states have internal predecessors, (3481), 0 states have call successors, (0), 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-21 21:02:47,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:47,375 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] [2023-11-21 21:02:47,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 21:02:47,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:47,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 495694408, now seen corresponding path program 1 times [2023-11-21 21:02:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424275528] [2023-11-21 21:02:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:47,421 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-21 21:02:47,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:47,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424275528] [2023-11-21 21:02:47,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424275528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:47,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:47,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:47,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014764085] [2023-11-21 21:02:47,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:47,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:47,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:47,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:47,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:47,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1159 out of 1210 [2023-11-21 21:02:47,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1099 places, 1143 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 1160.3333333333333) internal successors, (3481), 3 states have internal predecessors, (3481), 0 states have call successors, (0), 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-21 21:02:47,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:47,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1159 of 1210 [2023-11-21 21:02:47,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:47,965 INFO L124 PetriNetUnfolderBase]: 80/1483 cut-off events. [2023-11-21 21:02:47,965 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2023-11-21 21:02:47,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 1483 events. 80/1483 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7237 event pairs, 14 based on Foata normal form. 0/1202 useless extension candidates. Maximal degree in co-relation 1427. Up to 51 conditions per place. [2023-11-21 21:02:48,006 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 21 selfloop transitions, 2 changer transitions 0/1142 dead transitions. [2023-11-21 21:02:48,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1100 places, 1142 transitions, 2338 flow [2023-11-21 21:02:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3501 transitions. [2023-11-21 21:02:48,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644628099173553 [2023-11-21 21:02:48,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3501 transitions. [2023-11-21 21:02:48,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3501 transitions. [2023-11-21 21:02:48,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:48,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3501 transitions. [2023-11-21 21:02:48,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1167.0) internal successors, (3501), 3 states have internal predecessors, (3501), 0 states have call successors, (0), 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-21 21:02:48,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:48,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:48,033 INFO L175 Difference]: Start difference. First operand has 1099 places, 1143 transitions, 2294 flow. Second operand 3 states and 3501 transitions. [2023-11-21 21:02:48,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1100 places, 1142 transitions, 2338 flow [2023-11-21 21:02:48,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1098 places, 1142 transitions, 2334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:48,063 INFO L231 Difference]: Finished difference. Result has 1098 places, 1142 transitions, 2292 flow [2023-11-21 21:02:48,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=1096, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2292, PETRI_PLACES=1098, PETRI_TRANSITIONS=1142} [2023-11-21 21:02:48,066 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -18 predicate places. [2023-11-21 21:02:48,067 INFO L495 AbstractCegarLoop]: Abstraction has has 1098 places, 1142 transitions, 2292 flow [2023-11-21 21:02:48,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1160.3333333333333) internal successors, (3481), 3 states have internal predecessors, (3481), 0 states have call successors, (0), 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-21 21:02:48,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:48,069 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] [2023-11-21 21:02:48,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 21:02:48,069 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:48,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1958662170, now seen corresponding path program 1 times [2023-11-21 21:02:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399547504] [2023-11-21 21:02:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:48,220 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-21 21:02:48,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399547504] [2023-11-21 21:02:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399547504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:48,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026964308] [2023-11-21 21:02:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:48,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:48,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:48,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:48,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1134 out of 1210 [2023-11-21 21:02:48,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1098 places, 1142 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 1136.0) internal successors, (3408), 3 states have internal predecessors, (3408), 0 states have call successors, (0), 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-21 21:02:48,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:48,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1134 of 1210 [2023-11-21 21:02:48,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:49,904 INFO L124 PetriNetUnfolderBase]: 921/5972 cut-off events. [2023-11-21 21:02:49,904 INFO L125 PetriNetUnfolderBase]: For 10/15 co-relation queries the response was YES. [2023-11-21 21:02:49,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7155 conditions, 5972 events. 921/5972 cut-off events. For 10/15 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 56754 event pairs, 688 based on Foata normal form. 0/4562 useless extension candidates. Maximal degree in co-relation 7034. Up to 1165 conditions per place. [2023-11-21 21:02:50,000 INFO L140 encePairwiseOnDemand]: 1204/1210 looper letters, 44 selfloop transitions, 4 changer transitions 0/1140 dead transitions. [2023-11-21 21:02:50,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1098 places, 1140 transitions, 2384 flow [2023-11-21 21:02:50,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3452 transitions. [2023-11-21 21:02:50,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9509641873278237 [2023-11-21 21:02:50,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3452 transitions. [2023-11-21 21:02:50,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3452 transitions. [2023-11-21 21:02:50,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:50,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3452 transitions. [2023-11-21 21:02:50,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1150.6666666666667) internal successors, (3452), 3 states have internal predecessors, (3452), 0 states have call successors, (0), 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-21 21:02:50,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:50,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:50,021 INFO L175 Difference]: Start difference. First operand has 1098 places, 1142 transitions, 2292 flow. Second operand 3 states and 3452 transitions. [2023-11-21 21:02:50,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1098 places, 1140 transitions, 2384 flow [2023-11-21 21:02:50,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1096 places, 1140 transitions, 2380 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:50,046 INFO L231 Difference]: Finished difference. Result has 1096 places, 1140 transitions, 2292 flow [2023-11-21 21:02:50,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=1094, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2292, PETRI_PLACES=1096, PETRI_TRANSITIONS=1140} [2023-11-21 21:02:50,049 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -20 predicate places. [2023-11-21 21:02:50,049 INFO L495 AbstractCegarLoop]: Abstraction has has 1096 places, 1140 transitions, 2292 flow [2023-11-21 21:02:50,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1136.0) internal successors, (3408), 3 states have internal predecessors, (3408), 0 states have call successors, (0), 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-21 21:02:50,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:50,051 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] [2023-11-21 21:02:50,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 21:02:50,051 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:50,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:50,052 INFO L85 PathProgramCache]: Analyzing trace with hash -303711332, now seen corresponding path program 1 times [2023-11-21 21:02:50,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:50,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072324272] [2023-11-21 21:02:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:50,107 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-21 21:02:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072324272] [2023-11-21 21:02:50,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072324272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:50,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475869016] [2023-11-21 21:02:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:50,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:50,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1165 out of 1210 [2023-11-21 21:02:50,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1096 places, 1140 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:50,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:50,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1165 of 1210 [2023-11-21 21:02:50,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:51,155 INFO L124 PetriNetUnfolderBase]: 165/3019 cut-off events. [2023-11-21 21:02:51,155 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-11-21 21:02:51,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 3019 events. 165/3019 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18982 event pairs, 24 based on Foata normal form. 0/2412 useless extension candidates. Maximal degree in co-relation 3076. Up to 64 conditions per place. [2023-11-21 21:02:51,202 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 15 selfloop transitions, 2 changer transitions 0/1139 dead transitions. [2023-11-21 21:02:51,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1097 places, 1139 transitions, 2324 flow [2023-11-21 21:02:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-21 21:02:51,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-21 21:02:51,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-21 21:02:51,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-21 21:02:51,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:51,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-21 21:02:51,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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-21 21:02:51,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:51,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:51,218 INFO L175 Difference]: Start difference. First operand has 1096 places, 1140 transitions, 2292 flow. Second operand 3 states and 3513 transitions. [2023-11-21 21:02:51,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1097 places, 1139 transitions, 2324 flow [2023-11-21 21:02:51,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1095 places, 1139 transitions, 2316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:51,239 INFO L231 Difference]: Finished difference. Result has 1095 places, 1139 transitions, 2286 flow [2023-11-21 21:02:51,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2286, PETRI_PLACES=1095, PETRI_TRANSITIONS=1139} [2023-11-21 21:02:51,241 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -21 predicate places. [2023-11-21 21:02:51,241 INFO L495 AbstractCegarLoop]: Abstraction has has 1095 places, 1139 transitions, 2286 flow [2023-11-21 21:02:51,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:51,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:51,242 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] [2023-11-21 21:02:51,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 21:02:51,243 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:51,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash 226602223, now seen corresponding path program 1 times [2023-11-21 21:02:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:51,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612701992] [2023-11-21 21:02:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:51,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:51,311 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-21 21:02:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612701992] [2023-11-21 21:02:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612701992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:51,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:51,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:51,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618120177] [2023-11-21 21:02:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:51,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:51,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1165 out of 1210 [2023-11-21 21:02:51,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1095 places, 1139 transitions, 2286 flow. Second operand has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:51,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:51,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1165 of 1210 [2023-11-21 21:02:51,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:52,398 INFO L124 PetriNetUnfolderBase]: 165/3018 cut-off events. [2023-11-21 21:02:52,398 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-11-21 21:02:52,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 3018 events. 165/3018 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18895 event pairs, 24 based on Foata normal form. 0/2405 useless extension candidates. Maximal degree in co-relation 2929. Up to 64 conditions per place. [2023-11-21 21:02:52,485 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 15 selfloop transitions, 2 changer transitions 0/1138 dead transitions. [2023-11-21 21:02:52,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 1138 transitions, 2318 flow [2023-11-21 21:02:52,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3513 transitions. [2023-11-21 21:02:52,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9677685950413223 [2023-11-21 21:02:52,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3513 transitions. [2023-11-21 21:02:52,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3513 transitions. [2023-11-21 21:02:52,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:52,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3513 transitions. [2023-11-21 21:02:52,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1171.0) internal successors, (3513), 3 states have internal predecessors, (3513), 0 states have call successors, (0), 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-21 21:02:52,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:52,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:52,506 INFO L175 Difference]: Start difference. First operand has 1095 places, 1139 transitions, 2286 flow. Second operand 3 states and 3513 transitions. [2023-11-21 21:02:52,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1096 places, 1138 transitions, 2318 flow [2023-11-21 21:02:52,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 1138 transitions, 2314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:52,530 INFO L231 Difference]: Finished difference. Result has 1094 places, 1138 transitions, 2284 flow [2023-11-21 21:02:52,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=1092, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2284, PETRI_PLACES=1094, PETRI_TRANSITIONS=1138} [2023-11-21 21:02:52,534 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -22 predicate places. [2023-11-21 21:02:52,534 INFO L495 AbstractCegarLoop]: Abstraction has has 1094 places, 1138 transitions, 2284 flow [2023-11-21 21:02:52,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1166.3333333333333) internal successors, (3499), 3 states have internal predecessors, (3499), 0 states have call successors, (0), 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-21 21:02:52,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:52,536 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-21 21:02:52,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 21:02:52,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err57ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:52,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1419851932, now seen corresponding path program 1 times [2023-11-21 21:02:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182188733] [2023-11-21 21:02:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:52,624 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-21 21:02:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:52,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182188733] [2023-11-21 21:02:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182188733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:52,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:52,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:52,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865744456] [2023-11-21 21:02:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:52,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:52,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:52,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1155 out of 1210 [2023-11-21 21:02:52,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1094 places, 1138 transitions, 2284 flow. Second operand has 3 states, 3 states have (on average 1156.3333333333333) internal successors, (3469), 3 states have internal predecessors, (3469), 0 states have call successors, (0), 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-21 21:02:52,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:52,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1155 of 1210 [2023-11-21 21:02:52,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:54,119 INFO L124 PetriNetUnfolderBase]: 412/6351 cut-off events. [2023-11-21 21:02:54,119 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-21 21:02:54,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6573 conditions, 6351 events. 412/6351 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 57902 event pairs, 56 based on Foata normal form. 0/5072 useless extension candidates. Maximal degree in co-relation 6365. Up to 204 conditions per place. [2023-11-21 21:02:54,227 INFO L140 encePairwiseOnDemand]: 1196/1210 looper letters, 22 selfloop transitions, 6 changer transitions 0/1137 dead transitions. [2023-11-21 21:02:54,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1088 places, 1137 transitions, 2339 flow [2023-11-21 21:02:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3501 transitions. [2023-11-21 21:02:54,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644628099173553 [2023-11-21 21:02:54,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3501 transitions. [2023-11-21 21:02:54,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3501 transitions. [2023-11-21 21:02:54,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:54,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3501 transitions. [2023-11-21 21:02:54,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1167.0) internal successors, (3501), 3 states have internal predecessors, (3501), 0 states have call successors, (0), 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-21 21:02:54,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:54,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:54,246 INFO L175 Difference]: Start difference. First operand has 1094 places, 1138 transitions, 2284 flow. Second operand 3 states and 3501 transitions. [2023-11-21 21:02:54,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1088 places, 1137 transitions, 2339 flow [2023-11-21 21:02:54,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1086 places, 1137 transitions, 2335 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:02:54,273 INFO L231 Difference]: Finished difference. Result has 1087 places, 1136 transitions, 2306 flow [2023-11-21 21:02:54,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=1084, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2306, PETRI_PLACES=1087, PETRI_TRANSITIONS=1136} [2023-11-21 21:02:54,275 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -29 predicate places. [2023-11-21 21:02:54,275 INFO L495 AbstractCegarLoop]: Abstraction has has 1087 places, 1136 transitions, 2306 flow [2023-11-21 21:02:54,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1156.3333333333333) internal successors, (3469), 3 states have internal predecessors, (3469), 0 states have call successors, (0), 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-21 21:02:54,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:54,276 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-21 21:02:54,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 21:02:54,276 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err58ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:54,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash -885352819, now seen corresponding path program 1 times [2023-11-21 21:02:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370885090] [2023-11-21 21:02:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:54,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:54,355 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-21 21:02:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370885090] [2023-11-21 21:02:54,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370885090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:54,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111503416] [2023-11-21 21:02:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:54,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:54,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:54,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1155 out of 1210 [2023-11-21 21:02:54,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1087 places, 1136 transitions, 2306 flow. Second operand has 3 states, 3 states have (on average 1156.3333333333333) internal successors, (3469), 3 states have internal predecessors, (3469), 0 states have call successors, (0), 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-21 21:02:54,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:54,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1155 of 1210 [2023-11-21 21:02:54,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:55,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][439], [1207#(= |#race~is_null_1~0| 0), 721#L96-2true, 1212#(= |#race~is_null_5~0| 0), Black: 1205#true, 1017#L124-7true]) [2023-11-21 21:02:55,218 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2023-11-21 21:02:55,218 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2023-11-21 21:02:55,218 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2023-11-21 21:02:55,218 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-21 21:02:55,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][439], [1207#(= |#race~is_null_1~0| 0), 843#L96-12true, 1212#(= |#race~is_null_5~0| 0), Black: 1205#true, 1017#L124-7true]) [2023-11-21 21:02:55,290 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2023-11-21 21:02:55,291 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2023-11-21 21:02:55,291 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2023-11-21 21:02:55,291 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2023-11-21 21:02:55,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][439], [17#L96-13true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1205#true, 1017#L124-7true]) [2023-11-21 21:02:55,292 INFO L294 olderBase$Statistics]: this new event has 263 ancestors and is cut-off event [2023-11-21 21:02:55,292 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2023-11-21 21:02:55,292 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-21 21:02:55,292 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-21 21:02:56,612 INFO L124 PetriNetUnfolderBase]: 513/7607 cut-off events. [2023-11-21 21:02:56,613 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2023-11-21 21:02:56,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7932 conditions, 7607 events. 513/7607 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 73053 event pairs, 40 based on Foata normal form. 0/6113 useless extension candidates. Maximal degree in co-relation 6714. Up to 243 conditions per place. [2023-11-21 21:02:56,800 INFO L140 encePairwiseOnDemand]: 1196/1210 looper letters, 23 selfloop transitions, 6 changer transitions 0/1136 dead transitions. [2023-11-21 21:02:56,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1081 places, 1136 transitions, 2366 flow [2023-11-21 21:02:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:02:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3502 transitions. [2023-11-21 21:02:56,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9647382920110192 [2023-11-21 21:02:56,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3502 transitions. [2023-11-21 21:02:56,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3502 transitions. [2023-11-21 21:02:56,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:56,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3502 transitions. [2023-11-21 21:02:56,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1167.3333333333333) internal successors, (3502), 3 states have internal predecessors, (3502), 0 states have call successors, (0), 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-21 21:02:56,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:56,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:02:56,827 INFO L175 Difference]: Start difference. First operand has 1087 places, 1136 transitions, 2306 flow. Second operand 3 states and 3502 transitions. [2023-11-21 21:02:56,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1081 places, 1136 transitions, 2366 flow [2023-11-21 21:02:56,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1081 places, 1136 transitions, 2366 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 21:02:56,855 INFO L231 Difference]: Finished difference. Result has 1082 places, 1134 transitions, 2332 flow [2023-11-21 21:02:56,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=1079, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2332, PETRI_PLACES=1082, PETRI_TRANSITIONS=1134} [2023-11-21 21:02:56,858 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -34 predicate places. [2023-11-21 21:02:56,858 INFO L495 AbstractCegarLoop]: Abstraction has has 1082 places, 1134 transitions, 2332 flow [2023-11-21 21:02:56,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1156.3333333333333) internal successors, (3469), 3 states have internal predecessors, (3469), 0 states have call successors, (0), 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-21 21:02:56,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:56,859 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, 1, 1] [2023-11-21 21:02:56,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 21:02:56,860 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:56,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash -772323677, now seen corresponding path program 1 times [2023-11-21 21:02:56,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:56,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240587588] [2023-11-21 21:02:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:57,050 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-21 21:02:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240587588] [2023-11-21 21:02:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240587588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:02:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458808929] [2023-11-21 21:02:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:57,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:02:57,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:57,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:02:57,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:02:57,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1162 out of 1210 [2023-11-21 21:02:57,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1082 places, 1134 transitions, 2332 flow. Second operand has 5 states, 5 states have (on average 1165.6) internal successors, (5828), 5 states have internal predecessors, (5828), 0 states have call successors, (0), 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-21 21:02:57,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:02:57,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1162 of 1210 [2023-11-21 21:02:57,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:02:58,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][665], [1207#(= |#race~is_null_1~0| 0), 444#L125-7true, 1212#(= |#race~is_null_5~0| 0), 1215#true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:02:58,169 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is not cut-off event [2023-11-21 21:02:58,169 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is not cut-off event [2023-11-21 21:02:58,169 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is not cut-off event [2023-11-21 21:02:58,169 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is not cut-off event [2023-11-21 21:02:59,026 INFO L124 PetriNetUnfolderBase]: 208/3846 cut-off events. [2023-11-21 21:02:59,027 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-21 21:02:59,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3958 conditions, 3846 events. 208/3846 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 29267 event pairs, 0 based on Foata normal form. 2/3113 useless extension candidates. Maximal degree in co-relation 3633. Up to 36 conditions per place. [2023-11-21 21:02:59,188 INFO L140 encePairwiseOnDemand]: 1196/1210 looper letters, 12 selfloop transitions, 12 changer transitions 0/1136 dead transitions. [2023-11-21 21:02:59,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1086 places, 1136 transitions, 2384 flow [2023-11-21 21:02:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:02:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 21:02:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5836 transitions. [2023-11-21 21:02:59,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9646280991735537 [2023-11-21 21:02:59,199 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 5836 transitions. [2023-11-21 21:02:59,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5836 transitions. [2023-11-21 21:02:59,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:59,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 5836 transitions. [2023-11-21 21:02:59,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1167.2) internal successors, (5836), 5 states have internal predecessors, (5836), 0 states have call successors, (0), 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-21 21:02:59,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1210.0) internal successors, (7260), 6 states have internal predecessors, (7260), 0 states have call successors, (0), 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-21 21:02:59,224 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1210.0) internal successors, (7260), 6 states have internal predecessors, (7260), 0 states have call successors, (0), 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-21 21:02:59,224 INFO L175 Difference]: Start difference. First operand has 1082 places, 1134 transitions, 2332 flow. Second operand 5 states and 5836 transitions. [2023-11-21 21:02:59,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1086 places, 1136 transitions, 2384 flow [2023-11-21 21:02:59,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1086 places, 1136 transitions, 2384 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 21:02:59,253 INFO L231 Difference]: Finished difference. Result has 1087 places, 1136 transitions, 2372 flow [2023-11-21 21:02:59,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=1082, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2372, PETRI_PLACES=1087, PETRI_TRANSITIONS=1136} [2023-11-21 21:02:59,256 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -29 predicate places. [2023-11-21 21:02:59,256 INFO L495 AbstractCegarLoop]: Abstraction has has 1087 places, 1136 transitions, 2372 flow [2023-11-21 21:02:59,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1165.6) internal successors, (5828), 5 states have internal predecessors, (5828), 0 states have call successors, (0), 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-21 21:02:59,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:02:59,258 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, 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-21 21:02:59,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 21:02:59,258 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:02:59,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash -370427839, now seen corresponding path program 1 times [2023-11-21 21:02:59,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:59,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494045010] [2023-11-21 21:02:59,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:59,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:02:59,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494045010] [2023-11-21 21:02:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494045010] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:02:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154388871] [2023-11-21 21:02:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:59,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:02:59,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:02:59,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:02:59,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 21:02:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:59,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 21:02:59,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:02:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:02:59,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:03:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:03:00,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154388871] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:03:00,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:03:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-11-21 21:03:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133846545] [2023-11-21 21:03:00,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:03:00,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-21 21:03:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-21 21:03:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-21 21:03:00,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1156 out of 1210 [2023-11-21 21:03:00,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1087 places, 1136 transitions, 2372 flow. Second operand has 15 states, 15 states have (on average 1158.7333333333333) internal successors, (17381), 15 states have internal predecessors, (17381), 0 states have call successors, (0), 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-21 21:03:00,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:00,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1156 of 1210 [2023-11-21 21:03:00,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:01,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][681], [1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 444#L125-7true, 1215#true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 1205#true, 1226#true, Black: 1210#true]) [2023-11-21 21:03:01,569 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is not cut-off event [2023-11-21 21:03:01,569 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-21 21:03:01,569 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-21 21:03:01,569 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-21 21:03:02,237 INFO L124 PetriNetUnfolderBase]: 208/3872 cut-off events. [2023-11-21 21:03:02,237 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-21 21:03:02,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4028 conditions, 3872 events. 208/3872 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 29301 event pairs, 0 based on Foata normal form. 4/3141 useless extension candidates. Maximal degree in co-relation 3728. Up to 36 conditions per place. [2023-11-21 21:03:02,386 INFO L140 encePairwiseOnDemand]: 1190/1210 looper letters, 20 selfloop transitions, 26 changer transitions 0/1152 dead transitions. [2023-11-21 21:03:02,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1097 places, 1152 transitions, 2500 flow [2023-11-21 21:03:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 21:03:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-21 21:03:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12766 transitions. [2023-11-21 21:03:02,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9591284748309542 [2023-11-21 21:03:02,398 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 12766 transitions. [2023-11-21 21:03:02,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12766 transitions. [2023-11-21 21:03:02,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:02,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 12766 transitions. [2023-11-21 21:03:02,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 1160.5454545454545) internal successors, (12766), 11 states have internal predecessors, (12766), 0 states have call successors, (0), 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-21 21:03:02,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1210.0) internal successors, (14520), 12 states have internal predecessors, (14520), 0 states have call successors, (0), 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-21 21:03:02,438 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1210.0) internal successors, (14520), 12 states have internal predecessors, (14520), 0 states have call successors, (0), 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-21 21:03:02,438 INFO L175 Difference]: Start difference. First operand has 1087 places, 1136 transitions, 2372 flow. Second operand 11 states and 12766 transitions. [2023-11-21 21:03:02,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1097 places, 1152 transitions, 2500 flow [2023-11-21 21:03:02,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 1152 transitions, 2480 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-21 21:03:02,465 INFO L231 Difference]: Finished difference. Result has 1097 places, 1148 transitions, 2472 flow [2023-11-21 21:03:02,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=1084, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2472, PETRI_PLACES=1097, PETRI_TRANSITIONS=1148} [2023-11-21 21:03:02,467 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -19 predicate places. [2023-11-21 21:03:02,467 INFO L495 AbstractCegarLoop]: Abstraction has has 1097 places, 1148 transitions, 2472 flow [2023-11-21 21:03:02,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1158.7333333333333) internal successors, (17381), 15 states have internal predecessors, (17381), 0 states have call successors, (0), 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-21 21:03:02,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:02,471 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:02,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 21:03:02,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:03:02,693 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:03:02,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2006547199, now seen corresponding path program 2 times [2023-11-21 21:03:02,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264099651] [2023-11-21 21:03:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-21 21:03:03,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:03,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264099651] [2023-11-21 21:03:03,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264099651] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:03:03,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191931520] [2023-11-21 21:03:03,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:03:03,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:03:03,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:03:03,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:03:03,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 21:03:03,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-21 21:03:03,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:03:03,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-21 21:03:03,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:03:03,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 21:03:03,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 21:03:03,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:03:03,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 21:03:03,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:03:03,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 21:03:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-21 21:03:03,906 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:03:03,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191931520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:03:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2023-11-21 21:03:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483253417] [2023-11-21 21:03:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:03,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:03:03,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:03,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:03:03,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-21 21:03:04,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1168 out of 1210 [2023-11-21 21:03:04,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1097 places, 1148 transitions, 2472 flow. Second operand has 7 states, 7 states have (on average 1169.5714285714287) internal successors, (8187), 7 states have internal predecessors, (8187), 0 states have call successors, (0), 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-21 21:03:04,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:04,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1168 of 1210 [2023-11-21 21:03:04,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:05,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][676], [3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 1207#(= |#race~is_null_1~0| 0), 444#L125-7true, 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 1205#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 1226#true, Black: 1210#true, Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|))]) [2023-11-21 21:03:05,412 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is not cut-off event [2023-11-21 21:03:05,412 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-21 21:03:05,412 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-21 21:03:05,412 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-21 21:03:06,115 INFO L124 PetriNetUnfolderBase]: 208/3871 cut-off events. [2023-11-21 21:03:06,115 INFO L125 PetriNetUnfolderBase]: For 20/42 co-relation queries the response was YES. [2023-11-21 21:03:06,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 3871 events. 208/3871 cut-off events. For 20/42 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 29276 event pairs, 0 based on Foata normal form. 16/3153 useless extension candidates. Maximal degree in co-relation 3730. Up to 36 conditions per place. [2023-11-21 21:03:06,268 INFO L140 encePairwiseOnDemand]: 1204/1210 looper letters, 8 selfloop transitions, 5 changer transitions 0/1147 dead transitions. [2023-11-21 21:03:06,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1102 places, 1147 transitions, 2496 flow [2023-11-21 21:03:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:03:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 21:03:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8190 transitions. [2023-11-21 21:03:06,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9669421487603306 [2023-11-21 21:03:06,275 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 8190 transitions. [2023-11-21 21:03:06,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8190 transitions. [2023-11-21 21:03:06,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:06,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 8190 transitions. [2023-11-21 21:03:06,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 1170.0) internal successors, (8190), 7 states have internal predecessors, (8190), 0 states have call successors, (0), 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-21 21:03:06,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1210.0) internal successors, (9680), 8 states have internal predecessors, (9680), 0 states have call successors, (0), 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-21 21:03:06,291 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1210.0) internal successors, (9680), 8 states have internal predecessors, (9680), 0 states have call successors, (0), 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-21 21:03:06,292 INFO L175 Difference]: Start difference. First operand has 1097 places, 1148 transitions, 2472 flow. Second operand 7 states and 8190 transitions. [2023-11-21 21:03:06,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1102 places, 1147 transitions, 2496 flow [2023-11-21 21:03:06,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1099 places, 1147 transitions, 2472 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-21 21:03:06,315 INFO L231 Difference]: Finished difference. Result has 1099 places, 1147 transitions, 2456 flow [2023-11-21 21:03:06,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2446, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2456, PETRI_PLACES=1099, PETRI_TRANSITIONS=1147} [2023-11-21 21:03:06,317 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -17 predicate places. [2023-11-21 21:03:06,318 INFO L495 AbstractCegarLoop]: Abstraction has has 1099 places, 1147 transitions, 2456 flow [2023-11-21 21:03:06,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1169.5714285714287) internal successors, (8187), 7 states have internal predecessors, (8187), 0 states have call successors, (0), 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-21 21:03:06,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:06,320 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:06,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 21:03:06,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b06338c2-067c-4988-98c3-5b5c2981017b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:03:06,541 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:03:06,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash 509297894, now seen corresponding path program 1 times [2023-11-21 21:03:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:06,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113571938] [2023-11-21 21:03:06,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:06,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-21 21:03:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113571938] [2023-11-21 21:03:06,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113571938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:06,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:03:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472469544] [2023-11-21 21:03:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:06,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:03:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:06,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:06,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1160 out of 1210 [2023-11-21 21:03:06,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1099 places, 1147 transitions, 2456 flow. Second operand has 3 states, 3 states have (on average 1161.6666666666667) internal successors, (3485), 3 states have internal predecessors, (3485), 0 states have call successors, (0), 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-21 21:03:06,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:06,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1160 of 1210 [2023-11-21 21:03:06,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:07,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][676], [3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 444#L125-7true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 1205#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 1210#true, 3381#true]) [2023-11-21 21:03:07,527 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is not cut-off event [2023-11-21 21:03:07,527 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-21 21:03:07,527 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-21 21:03:07,527 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-21 21:03:08,123 INFO L124 PetriNetUnfolderBase]: 303/5032 cut-off events. [2023-11-21 21:03:08,124 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-21 21:03:08,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5347 conditions, 5032 events. 303/5032 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 42079 event pairs, 32 based on Foata normal form. 0/4060 useless extension candidates. Maximal degree in co-relation 5218. Up to 110 conditions per place. [2023-11-21 21:03:08,218 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 22 selfloop transitions, 2 changer transitions 0/1147 dead transitions. [2023-11-21 21:03:08,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1100 places, 1147 transitions, 2505 flow [2023-11-21 21:03:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:03:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3505 transitions. [2023-11-21 21:03:08,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9655647382920111 [2023-11-21 21:03:08,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3505 transitions. [2023-11-21 21:03:08,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3505 transitions. [2023-11-21 21:03:08,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:08,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3505 transitions. [2023-11-21 21:03:08,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1168.3333333333333) internal successors, (3505), 3 states have internal predecessors, (3505), 0 states have call successors, (0), 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-21 21:03:08,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:08,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:08,229 INFO L175 Difference]: Start difference. First operand has 1099 places, 1147 transitions, 2456 flow. Second operand 3 states and 3505 transitions. [2023-11-21 21:03:08,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1100 places, 1147 transitions, 2505 flow [2023-11-21 21:03:08,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1095 places, 1147 transitions, 2496 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-21 21:03:08,253 INFO L231 Difference]: Finished difference. Result has 1095 places, 1146 transitions, 2449 flow [2023-11-21 21:03:08,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2445, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2449, PETRI_PLACES=1095, PETRI_TRANSITIONS=1146} [2023-11-21 21:03:08,255 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -21 predicate places. [2023-11-21 21:03:08,256 INFO L495 AbstractCegarLoop]: Abstraction has has 1095 places, 1146 transitions, 2449 flow [2023-11-21 21:03:08,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1161.6666666666667) internal successors, (3485), 3 states have internal predecessors, (3485), 0 states have call successors, (0), 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-21 21:03:08,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:08,257 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:08,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-21 21:03:08,258 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:03:08,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash -727975071, now seen corresponding path program 1 times [2023-11-21 21:03:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287615971] [2023-11-21 21:03:08,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-21 21:03:08,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:08,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287615971] [2023-11-21 21:03:08,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287615971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:03:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543755935] [2023-11-21 21:03:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:08,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:03:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:08,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:08,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:08,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1161 out of 1210 [2023-11-21 21:03:08,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1095 places, 1146 transitions, 2449 flow. Second operand has 3 states, 3 states have (on average 1162.6666666666667) internal successors, (3488), 3 states have internal predecessors, (3488), 0 states have call successors, (0), 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-21 21:03:08,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:08,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1161 of 1210 [2023-11-21 21:03:08,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:09,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][675], [3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 1207#(= |#race~is_null_1~0| 0), 444#L125-7true, 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 1205#true, 3385#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3381#true, Black: 1210#true]) [2023-11-21 21:03:09,099 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is not cut-off event [2023-11-21 21:03:09,099 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-21 21:03:09,099 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-21 21:03:09,100 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is not cut-off event [2023-11-21 21:03:09,625 INFO L124 PetriNetUnfolderBase]: 301/5016 cut-off events. [2023-11-21 21:03:09,625 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2023-11-21 21:03:09,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5317 conditions, 5016 events. 301/5016 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 41735 event pairs, 30 based on Foata normal form. 0/4048 useless extension candidates. Maximal degree in co-relation 5023. Up to 104 conditions per place. [2023-11-21 21:03:09,710 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 21 selfloop transitions, 2 changer transitions 0/1146 dead transitions. [2023-11-21 21:03:09,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 1146 transitions, 2496 flow [2023-11-21 21:03:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:03:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3507 transitions. [2023-11-21 21:03:09,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9661157024793389 [2023-11-21 21:03:09,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3507 transitions. [2023-11-21 21:03:09,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3507 transitions. [2023-11-21 21:03:09,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:09,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3507 transitions. [2023-11-21 21:03:09,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1169.0) internal successors, (3507), 3 states have internal predecessors, (3507), 0 states have call successors, (0), 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-21 21:03:09,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:09,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:09,721 INFO L175 Difference]: Start difference. First operand has 1095 places, 1146 transitions, 2449 flow. Second operand 3 states and 3507 transitions. [2023-11-21 21:03:09,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1096 places, 1146 transitions, 2496 flow [2023-11-21 21:03:09,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 1146 transitions, 2492 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:03:09,744 INFO L231 Difference]: Finished difference. Result has 1094 places, 1145 transitions, 2447 flow [2023-11-21 21:03:09,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=1092, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2447, PETRI_PLACES=1094, PETRI_TRANSITIONS=1145} [2023-11-21 21:03:09,746 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -22 predicate places. [2023-11-21 21:03:09,746 INFO L495 AbstractCegarLoop]: Abstraction has has 1094 places, 1145 transitions, 2447 flow [2023-11-21 21:03:09,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1162.6666666666667) internal successors, (3488), 3 states have internal predecessors, (3488), 0 states have call successors, (0), 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-21 21:03:09,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:09,748 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:09,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 21:03:09,748 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err65ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:03:09,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash -344813227, now seen corresponding path program 1 times [2023-11-21 21:03:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526792703] [2023-11-21 21:03:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-21 21:03:09,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:09,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526792703] [2023-11-21 21:03:09,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526792703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:09,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:09,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607217910] [2023-11-21 21:03:09,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:09,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:03:09,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:09,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:09,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:09,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1173 out of 1210 [2023-11-21 21:03:09,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1094 places, 1145 transitions, 2447 flow. Second operand has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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-21 21:03:09,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:09,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1173 of 1210 [2023-11-21 21:03:09,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:11,230 INFO L124 PetriNetUnfolderBase]: 247/4484 cut-off events. [2023-11-21 21:03:11,230 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-21 21:03:11,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4710 conditions, 4484 events. 247/4484 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 35852 event pairs, 8 based on Foata normal form. 0/3647 useless extension candidates. Maximal degree in co-relation 4417. Up to 43 conditions per place. [2023-11-21 21:03:11,372 INFO L140 encePairwiseOnDemand]: 1206/1210 looper letters, 11 selfloop transitions, 3 changer transitions 0/1148 dead transitions. [2023-11-21 21:03:11,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 1148 transitions, 2482 flow [2023-11-21 21:03:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:03:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3534 transitions. [2023-11-21 21:03:11,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9735537190082645 [2023-11-21 21:03:11,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3534 transitions. [2023-11-21 21:03:11,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3534 transitions. [2023-11-21 21:03:11,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:11,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3534 transitions. [2023-11-21 21:03:11,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1178.0) internal successors, (3534), 3 states have internal predecessors, (3534), 0 states have call successors, (0), 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-21 21:03:11,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:11,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:11,382 INFO L175 Difference]: Start difference. First operand has 1094 places, 1145 transitions, 2447 flow. Second operand 3 states and 3534 transitions. [2023-11-21 21:03:11,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1096 places, 1148 transitions, 2482 flow [2023-11-21 21:03:11,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 1148 transitions, 2478 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:03:11,404 INFO L231 Difference]: Finished difference. Result has 1096 places, 1147 transitions, 2465 flow [2023-11-21 21:03:11,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=1092, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2465, PETRI_PLACES=1096, PETRI_TRANSITIONS=1147} [2023-11-21 21:03:11,407 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -20 predicate places. [2023-11-21 21:03:11,407 INFO L495 AbstractCegarLoop]: Abstraction has has 1096 places, 1147 transitions, 2465 flow [2023-11-21 21:03:11,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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-21 21:03:11,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:11,408 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:11,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-21 21:03:11,409 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:03:11,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1650706898, now seen corresponding path program 1 times [2023-11-21 21:03:11,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:11,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986809513] [2023-11-21 21:03:11,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:11,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-21 21:03:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986809513] [2023-11-21 21:03:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986809513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:03:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301390178] [2023-11-21 21:03:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:11,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:03:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:11,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1160 out of 1210 [2023-11-21 21:03:11,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1096 places, 1147 transitions, 2465 flow. Second operand has 3 states, 3 states have (on average 1162.0) internal successors, (3486), 3 states have internal predecessors, (3486), 0 states have call successors, (0), 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-21 21:03:11,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:11,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1160 of 1210 [2023-11-21 21:03:11,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:12,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 94#L78-2true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,021 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2023-11-21 21:03:12,021 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2023-11-21 21:03:12,021 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-21 21:03:12,021 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-21 21:03:12,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3229] L78-1-->L78-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet48#1=|v_thread2Thread1of1ForFork0_#t~nondet48#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet48#1][343], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 94#L78-2true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,207 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is not cut-off event [2023-11-21 21:03:12,207 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is not cut-off event [2023-11-21 21:03:12,207 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is not cut-off event [2023-11-21 21:03:12,207 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is not cut-off event [2023-11-21 21:03:12,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][507], [3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 3397#(= |thread2Thread1of1ForFork0_#t~nondet48#1| |#race~i_12~0|), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 812#L78-3true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,208 INFO L294 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2023-11-21 21:03:12,208 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-21 21:03:12,208 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-21 21:03:12,208 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2023-11-21 21:03:12,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][507], [3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 3397#(= |thread2Thread1of1ForFork0_#t~nondet48#1| |#race~i_12~0|), 1212#(= |#race~is_null_5~0| 0), 650#L78-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,223 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2023-11-21 21:03:12,223 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2023-11-21 21:03:12,223 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2023-11-21 21:03:12,223 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2023-11-21 21:03:12,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1116#L79true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,238 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2023-11-21 21:03:12,238 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2023-11-21 21:03:12,238 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2023-11-21 21:03:12,238 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2023-11-21 21:03:12,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 11#L91true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,341 INFO L294 olderBase$Statistics]: this new event has 330 ancestors and is cut-off event [2023-11-21 21:03:12,341 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-21 21:03:12,341 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-21 21:03:12,341 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2023-11-21 21:03:12,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 611#L82-1true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,342 INFO L294 olderBase$Statistics]: this new event has 330 ancestors and is cut-off event [2023-11-21 21:03:12,342 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-21 21:03:12,342 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-21 21:03:12,342 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2023-11-21 21:03:12,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 612#L83-3true, 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,496 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2023-11-21 21:03:12,496 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2023-11-21 21:03:12,496 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2023-11-21 21:03:12,496 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2023-11-21 21:03:12,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][724], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:12,497 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is not cut-off event [2023-11-21 21:03:12,497 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-21 21:03:12,497 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is not cut-off event [2023-11-21 21:03:12,497 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-21 21:03:12,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 1100#L83-12true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,598 INFO L294 olderBase$Statistics]: this new event has 352 ancestors and is cut-off event [2023-11-21 21:03:12,598 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2023-11-21 21:03:12,598 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2023-11-21 21:03:12,599 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2023-11-21 21:03:12,655 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][724], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:12,655 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2023-11-21 21:03:12,655 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2023-11-21 21:03:12,655 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is cut-off event [2023-11-21 21:03:12,655 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2023-11-21 21:03:12,656 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2023-11-21 21:03:12,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 782#L84-3true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,733 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2023-11-21 21:03:12,733 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2023-11-21 21:03:12,733 INFO L297 olderBase$Statistics]: existing Event has 369 ancestors and is cut-off event [2023-11-21 21:03:12,733 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2023-11-21 21:03:12,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 940#L84-12true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:12,852 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-11-21 21:03:12,852 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2023-11-21 21:03:12,852 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2023-11-21 21:03:12,852 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2023-11-21 21:03:13,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 243#L85-15true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:13,045 INFO L294 olderBase$Statistics]: this new event has 386 ancestors and is cut-off event [2023-11-21 21:03:13,045 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2023-11-21 21:03:13,046 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2023-11-21 21:03:13,046 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2023-11-21 21:03:13,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 934#L85-7true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:13,064 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2023-11-21 21:03:13,064 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2023-11-21 21:03:13,064 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2023-11-21 21:03:13,065 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2023-11-21 21:03:13,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 45#L86-7true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:13,263 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2023-11-21 21:03:13,263 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2023-11-21 21:03:13,263 INFO L297 olderBase$Statistics]: existing Event has 409 ancestors and is cut-off event [2023-11-21 21:03:13,264 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2023-11-21 21:03:13,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 619#L87-15true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:13,307 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2023-11-21 21:03:13,308 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-11-21 21:03:13,308 INFO L297 olderBase$Statistics]: existing Event has 422 ancestors and is cut-off event [2023-11-21 21:03:13,308 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-11-21 21:03:13,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), 567#L87-7true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:13,310 INFO L294 olderBase$Statistics]: this new event has 417 ancestors and is cut-off event [2023-11-21 21:03:13,310 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2023-11-21 21:03:13,310 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2023-11-21 21:03:13,310 INFO L297 olderBase$Statistics]: existing Event has 423 ancestors and is cut-off event [2023-11-21 21:03:13,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 735#L88-7true, Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:13,317 INFO L294 olderBase$Statistics]: this new event has 433 ancestors and is cut-off event [2023-11-21 21:03:13,318 INFO L297 olderBase$Statistics]: existing Event has 436 ancestors and is cut-off event [2023-11-21 21:03:13,318 INFO L297 olderBase$Statistics]: existing Event has 439 ancestors and is cut-off event [2023-11-21 21:03:13,318 INFO L297 olderBase$Statistics]: existing Event has 436 ancestors and is cut-off event [2023-11-21 21:03:13,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 314#L89-1true, 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:13,322 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2023-11-21 21:03:13,322 INFO L297 olderBase$Statistics]: existing Event has 444 ancestors and is cut-off event [2023-11-21 21:03:13,322 INFO L297 olderBase$Statistics]: existing Event has 447 ancestors and is cut-off event [2023-11-21 21:03:13,322 INFO L297 olderBase$Statistics]: existing Event has 444 ancestors and is cut-off event [2023-11-21 21:03:13,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][481], [3395#true, 3389#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 413#L89-6true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:13,324 INFO L294 olderBase$Statistics]: this new event has 446 ancestors and is cut-off event [2023-11-21 21:03:13,324 INFO L297 olderBase$Statistics]: existing Event has 449 ancestors and is cut-off event [2023-11-21 21:03:13,324 INFO L297 olderBase$Statistics]: existing Event has 449 ancestors and is cut-off event [2023-11-21 21:03:13,325 INFO L297 olderBase$Statistics]: existing Event has 452 ancestors and is cut-off event [2023-11-21 21:03:13,326 INFO L124 PetriNetUnfolderBase]: 299/4286 cut-off events. [2023-11-21 21:03:13,326 INFO L125 PetriNetUnfolderBase]: For 98/100 co-relation queries the response was YES. [2023-11-21 21:03:13,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 4286 events. 299/4286 cut-off events. For 98/100 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 33881 event pairs, 16 based on Foata normal form. 0/3445 useless extension candidates. Maximal degree in co-relation 4367. Up to 192 conditions per place. [2023-11-21 21:03:13,489 INFO L140 encePairwiseOnDemand]: 1207/1210 looper letters, 22 selfloop transitions, 2 changer transitions 0/1147 dead transitions. [2023-11-21 21:03:13,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1097 places, 1147 transitions, 2514 flow [2023-11-21 21:03:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:03:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3505 transitions. [2023-11-21 21:03:13,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9655647382920111 [2023-11-21 21:03:13,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3505 transitions. [2023-11-21 21:03:13,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3505 transitions. [2023-11-21 21:03:13,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:13,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3505 transitions. [2023-11-21 21:03:13,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1168.3333333333333) internal successors, (3505), 3 states have internal predecessors, (3505), 0 states have call successors, (0), 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-21 21:03:13,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:13,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:13,504 INFO L175 Difference]: Start difference. First operand has 1096 places, 1147 transitions, 2465 flow. Second operand 3 states and 3505 transitions. [2023-11-21 21:03:13,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1097 places, 1147 transitions, 2514 flow [2023-11-21 21:03:13,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1095 places, 1147 transitions, 2508 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:03:13,528 INFO L231 Difference]: Finished difference. Result has 1095 places, 1146 transitions, 2461 flow [2023-11-21 21:03:13,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2457, PETRI_DIFFERENCE_MINUEND_PLACES=1093, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2461, PETRI_PLACES=1095, PETRI_TRANSITIONS=1146} [2023-11-21 21:03:13,530 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -21 predicate places. [2023-11-21 21:03:13,530 INFO L495 AbstractCegarLoop]: Abstraction has has 1095 places, 1146 transitions, 2461 flow [2023-11-21 21:03:13,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1162.0) internal successors, (3486), 3 states have internal predecessors, (3486), 0 states have call successors, (0), 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-21 21:03:13,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:13,532 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:13,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-21 21:03:13,532 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err63ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:03:13,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2035620093, now seen corresponding path program 1 times [2023-11-21 21:03:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:13,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21758515] [2023-11-21 21:03:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-21 21:03:13,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21758515] [2023-11-21 21:03:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21758515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:13,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:03:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958696234] [2023-11-21 21:03:13,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:13,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:03:13,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:13,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:13,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:13,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1173 out of 1210 [2023-11-21 21:03:13,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1095 places, 1146 transitions, 2461 flow. Second operand has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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-21 21:03:13,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:13,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1173 of 1210 [2023-11-21 21:03:13,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:13,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2818] L69-22-->L69-23: Formula: (= |v_#race~get_subject_3~0_1| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_1|} AuxVars[] AssignedVars[#race~get_subject_3~0][467], [3395#true, Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:13,889 INFO L294 olderBase$Statistics]: this new event has 313 ancestors and is cut-off event [2023-11-21 21:03:13,889 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2023-11-21 21:03:13,889 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-21 21:03:13,889 INFO L297 olderBase$Statistics]: existing Event has 310 ancestors and is cut-off event [2023-11-21 21:03:14,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][508], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:14,101 INFO L294 olderBase$Statistics]: this new event has 329 ancestors and is cut-off event [2023-11-21 21:03:14,101 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2023-11-21 21:03:14,101 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2023-11-21 21:03:14,101 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2023-11-21 21:03:14,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][456], [3395#true, Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:14,163 INFO L294 olderBase$Statistics]: this new event has 310 ancestors and is not cut-off event [2023-11-21 21:03:14,164 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-21 21:03:14,164 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is not cut-off event [2023-11-21 21:03:14,164 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-21 21:03:14,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][456], [3395#true, Black: 3389#true, 691#L69-24true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), 3401#(= |#race~get_subject_3~0| 0), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:14,164 INFO L294 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2023-11-21 21:03:14,164 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-21 21:03:14,164 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-21 21:03:14,164 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-21 21:03:14,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2818] L69-22-->L69-23: Formula: (= |v_#race~get_subject_3~0_1| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_1|} AuxVars[] AssignedVars[#race~get_subject_3~0][467], [3395#true, Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 150#L96-26true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:14,165 INFO L294 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2023-11-21 21:03:14,165 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-21 21:03:14,165 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-21 21:03:14,165 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2023-11-21 21:03:14,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][455], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:14,460 INFO L294 olderBase$Statistics]: this new event has 329 ancestors and is not cut-off event [2023-11-21 21:03:14,460 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is not cut-off event [2023-11-21 21:03:14,460 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is not cut-off event [2023-11-21 21:03:14,460 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is not cut-off event [2023-11-21 21:03:14,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][508], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), 3401#(= |#race~get_subject_3~0| 0), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 150#L96-26true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:14,460 INFO L294 olderBase$Statistics]: this new event has 330 ancestors and is cut-off event [2023-11-21 21:03:14,460 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2023-11-21 21:03:14,460 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-21 21:03:14,460 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-21 21:03:14,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][456], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:14,586 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2023-11-21 21:03:14,586 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2023-11-21 21:03:14,586 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2023-11-21 21:03:14,586 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2023-11-21 21:03:14,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][725], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, 3399#true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:14,647 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is not cut-off event [2023-11-21 21:03:14,647 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-21 21:03:14,647 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is not cut-off event [2023-11-21 21:03:14,647 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-21 21:03:14,724 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][508], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 150#L96-26true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:14,724 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2023-11-21 21:03:14,724 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2023-11-21 21:03:14,724 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-21 21:03:14,724 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2023-11-21 21:03:14,724 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2023-11-21 21:03:14,725 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([3641] thread1EXIT-->L124-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem123#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem123#1=|v_ULTIMATE.start_main_#t~mem123#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][508], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 882#L96-25true, 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), Black: 1205#true, 1017#L124-7true, Black: 1210#true]) [2023-11-21 21:03:14,725 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2023-11-21 21:03:14,725 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2023-11-21 21:03:14,725 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2023-11-21 21:03:14,725 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2023-11-21 21:03:14,725 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2023-11-21 21:03:14,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][858], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), 3401#(= |#race~get_subject_3~0| 0), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:14,922 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2023-11-21 21:03:14,922 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2023-11-21 21:03:14,922 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2023-11-21 21:03:14,923 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2023-11-21 21:03:15,007 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([3642] thread2EXIT-->L125-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem124#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem124#1=|v_ULTIMATE.start_main_#t~mem124#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][858], [3395#true, Black: 3391#(not |thread1Thread1of1ForFork1_#t~short40#1|), 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3379#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 3) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 1) 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) 2) 0)), 444#L125-7true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:15,007 INFO L294 olderBase$Statistics]: this new event has 371 ancestors and is not cut-off event [2023-11-21 21:03:15,008 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is not cut-off event [2023-11-21 21:03:15,008 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is not cut-off event [2023-11-21 21:03:15,008 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is not cut-off event [2023-11-21 21:03:15,008 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is not cut-off event [2023-11-21 21:03:15,482 INFO L124 PetriNetUnfolderBase]: 239/4356 cut-off events. [2023-11-21 21:03:15,483 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2023-11-21 21:03:15,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4620 conditions, 4356 events. 239/4356 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 35169 event pairs, 2 based on Foata normal form. 0/3583 useless extension candidates. Maximal degree in co-relation 4325. Up to 76 conditions per place. [2023-11-21 21:03:15,674 INFO L140 encePairwiseOnDemand]: 1206/1210 looper letters, 12 selfloop transitions, 2 changer transitions 0/1149 dead transitions. [2023-11-21 21:03:15,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1095 places, 1149 transitions, 2498 flow [2023-11-21 21:03:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:03:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3535 transitions. [2023-11-21 21:03:15,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9738292011019284 [2023-11-21 21:03:15,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3535 transitions. [2023-11-21 21:03:15,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3535 transitions. [2023-11-21 21:03:15,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:15,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3535 transitions. [2023-11-21 21:03:15,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1178.3333333333333) internal successors, (3535), 3 states have internal predecessors, (3535), 0 states have call successors, (0), 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-21 21:03:15,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:15,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1210.0) internal successors, (4840), 4 states have internal predecessors, (4840), 0 states have call successors, (0), 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-21 21:03:15,688 INFO L175 Difference]: Start difference. First operand has 1095 places, 1146 transitions, 2461 flow. Second operand 3 states and 3535 transitions. [2023-11-21 21:03:15,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1095 places, 1149 transitions, 2498 flow [2023-11-21 21:03:15,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1093 places, 1149 transitions, 2494 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:03:15,710 INFO L231 Difference]: Finished difference. Result has 1094 places, 1146 transitions, 2467 flow [2023-11-21 21:03:15,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1210, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=1091, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2467, PETRI_PLACES=1094, PETRI_TRANSITIONS=1146} [2023-11-21 21:03:15,712 INFO L281 CegarLoopForPetriNet]: 1116 programPoint places, -22 predicate places. [2023-11-21 21:03:15,713 INFO L495 AbstractCegarLoop]: Abstraction has has 1094 places, 1146 transitions, 2467 flow [2023-11-21 21:03:15,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1174.3333333333333) internal successors, (3523), 3 states have internal predecessors, (3523), 0 states have call successors, (0), 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-21 21:03:15,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:03:15,714 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:15,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-21 21:03:15,714 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err65ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 284 more)] === [2023-11-21 21:03:15,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 223741259, now seen corresponding path program 1 times [2023-11-21 21:03:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:15,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591762930] [2023-11-21 21:03:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-21 21:03:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:15,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591762930] [2023-11-21 21:03:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591762930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:15,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:03:15,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768074798] [2023-11-21 21:03:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:15,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:03:15,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:15,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:15,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1210 [2023-11-21 21:03:15,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1094 places, 1146 transitions, 2467 flow. Second operand has 3 states, 3 states have (on average 1165.6666666666667) internal successors, (3497), 3 states have internal predecessors, (3497), 0 states have call successors, (0), 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-21 21:03:15,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:03:15,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1210 [2023-11-21 21:03:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:03:16,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2818] L69-22-->L69-23: Formula: (= |v_#race~get_subject_3~0_1| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_1|} AuxVars[] AssignedVars[#race~get_subject_3~0][465], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:16,100 INFO L294 olderBase$Statistics]: this new event has 313 ancestors and is cut-off event [2023-11-21 21:03:16,100 INFO L297 olderBase$Statistics]: existing Event has 310 ancestors and is cut-off event [2023-11-21 21:03:16,100 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-21 21:03:16,100 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2023-11-21 21:03:16,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3286] L96-24-->L96-25: Formula: (= |v_#race~get_subject_3~0_4| 0) InVars {} OutVars{#race~get_subject_3~0=|v_#race~get_subject_3~0_4|} AuxVars[] AssignedVars[#race~get_subject_3~0][454], [Black: 3389#true, 1207#(= |#race~is_null_1~0| 0), 1212#(= |#race~is_null_5~0| 0), 1105#L123-4true, Black: 1223#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 3399#true, Black: 2564#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 2556#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3401#(= |#race~get_subject_3~0| 0), Black: 2570#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 3404#true, 882#L96-25true, 65#L69-23true, Black: 1205#true, Black: 1210#true]) [2023-11-21 21:03:16,337 INFO L294 olderBase$Statistics]: this new event has 310 ancestors and is not cut-off event [2023-11-21 21:03:16,337 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event [2023-11-21 21:03:16,337 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is not cut-off event [2023-11-21 21:03:16,337 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is not cut-off event