./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:25:51,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:25:51,226 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 05:25:51,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:25:51,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:25:51,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:25:51,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:25:51,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:25:51,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:25:51,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:25:51,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:25:51,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:25:51,263 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:25:51,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:25:51,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:25:51,265 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:25:51,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:25:51,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:25:51,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:25:51,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:25:51,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:25:51,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:25:51,269 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 05:25:51,269 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:25:51,270 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:25:51,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:25:51,270 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:25:51,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:25:51,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:25:51,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:25:51,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:25:51,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:25:51,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:25:51,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:25:51,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:25:51,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:25:51,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:25:51,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:25:51,274 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:25:51,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:25:51,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:25:51,275 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_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/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_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2023-11-29 05:25:51,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:25:51,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:25:51,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:25:51,568 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:25:51,568 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:25:51,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2023-11-29 05:25:54,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:25:54,794 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:25:54,794 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2023-11-29 05:25:54,806 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/data/a22906ce9/c60443b6926f4ebe9441d3a55ee05ca2/FLAG7175b4b58 [2023-11-29 05:25:54,823 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/data/a22906ce9/c60443b6926f4ebe9441d3a55ee05ca2 [2023-11-29 05:25:54,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:25:54,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:25:54,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:25:54,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:25:54,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:25:54,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:25:54" (1/1) ... [2023-11-29 05:25:54,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de77320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:54, skipping insertion in model container [2023-11-29 05:25:54,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:25:54" (1/1) ... [2023-11-29 05:25:54,865 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:25:55,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:25:55,094 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:25:55,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:25:55,163 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:25:55,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55 WrapperNode [2023-11-29 05:25:55,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:25:55,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:25:55,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:25:55,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:25:55,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,233 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 610 [2023-11-29 05:25:55,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:25:55,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:25:55,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:25:55,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:25:55,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:25:55,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:25:55,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:25:55,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:25:55,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (1/1) ... [2023-11-29 05:25:55,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:25:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:25:55,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:25:55,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:25:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:25:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:25:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 05:25:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 05:25:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 05:25:55,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 05:25:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 05:25:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 05:25:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 05:25:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:25:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:25:55,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:25:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:25:55,376 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:25:55,516 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:25:55,519 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:25:56,356 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:25:56,386 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:25:56,386 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 05:25:56,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:25:56 BoogieIcfgContainer [2023-11-29 05:25:56,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:25:56,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:25:56,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:25:56,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:25:56,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:25:54" (1/3) ... [2023-11-29 05:25:56,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5b2911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:25:56, skipping insertion in model container [2023-11-29 05:25:56,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:55" (2/3) ... [2023-11-29 05:25:56,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5b2911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:25:56, skipping insertion in model container [2023-11-29 05:25:56,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:25:56" (3/3) ... [2023-11-29 05:25:56,399 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2023-11-29 05:25:56,407 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 05:25:56,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:25:56,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2023-11-29 05:25:56,417 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:25:56,578 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 05:25:56,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 758 places, 792 transitions, 1598 flow [2023-11-29 05:25:57,079 INFO L124 PetriNetUnfolderBase]: 41/790 cut-off events. [2023-11-29 05:25:57,080 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 05:25:57,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 790 events. 41/790 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2082 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 571. Up to 2 conditions per place. [2023-11-29 05:25:57,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 758 places, 792 transitions, 1598 flow [2023-11-29 05:25:57,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 732 places, 764 transitions, 1540 flow [2023-11-29 05:25:57,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:25:57,157 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;@f6fffe9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:25:57,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2023-11-29 05:25:57,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:25:57,163 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2023-11-29 05:25:57,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:25:57,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:57,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:57,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:25:57,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash -111058263, now seen corresponding path program 1 times [2023-11-29 05:25:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600973653] [2023-11-29 05:25:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,393 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-29 05:25:57,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:57,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600973653] [2023-11-29 05:25:57,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600973653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:57,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:57,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:25:57,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740980733] [2023-11-29 05:25:57,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:57,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:57,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:57,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:25:57,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 764 transitions, 1540 flow. Second operand has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:57,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:57,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:25:57,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:58,412 INFO L124 PetriNetUnfolderBase]: 133/2445 cut-off events. [2023-11-29 05:25:58,412 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2023-11-29 05:25:58,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 2445 events. 133/2445 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 15574 event pairs, 35 based on Foata normal form. 66/2007 useless extension candidates. Maximal degree in co-relation 2075. Up to 88 conditions per place. [2023-11-29 05:25:58,468 INFO L140 encePairwiseOnDemand]: 776/792 looper letters, 17 selfloop transitions, 2 changer transitions 2/750 dead transitions. [2023-11-29 05:25:58,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 750 transitions, 1550 flow [2023-11-29 05:25:58,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:25:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:25:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2023-11-29 05:25:58,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9684343434343434 [2023-11-29 05:25:58,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2023-11-29 05:25:58,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2023-11-29 05:25:58,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:58,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2023-11-29 05:25:58,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:58,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:58,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:58,546 INFO L175 Difference]: Start difference. First operand has 732 places, 764 transitions, 1540 flow. Second operand 3 states and 2301 transitions. [2023-11-29 05:25:58,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 750 transitions, 1550 flow [2023-11-29 05:25:58,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 750 transitions, 1542 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:25:58,585 INFO L231 Difference]: Finished difference. Result has 729 places, 748 transitions, 1504 flow [2023-11-29 05:25:58,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1504, PETRI_PLACES=729, PETRI_TRANSITIONS=748} [2023-11-29 05:25:58,594 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -3 predicate places. [2023-11-29 05:25:58,594 INFO L495 AbstractCegarLoop]: Abstraction has has 729 places, 748 transitions, 1504 flow [2023-11-29 05:25:58,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:58,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:58,598 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] [2023-11-29 05:25:58,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:25:58,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:25:58,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:58,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1451005741, now seen corresponding path program 1 times [2023-11-29 05:25:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:58,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306418060] [2023-11-29 05:25:58,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:58,680 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-29 05:25:58,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:58,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306418060] [2023-11-29 05:25:58,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306418060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:25:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245575978] [2023-11-29 05:25:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:58,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:58,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:58,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:58,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:25:58,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 748 transitions, 1504 flow. Second operand has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:58,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:58,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:25:58,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:59,484 INFO L124 PetriNetUnfolderBase]: 133/2445 cut-off events. [2023-11-29 05:25:59,484 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2023-11-29 05:25:59,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 2445 events. 133/2445 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 15114 event pairs, 35 based on Foata normal form. 0/1938 useless extension candidates. Maximal degree in co-relation 2510. Up to 88 conditions per place. [2023-11-29 05:25:59,532 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 2 changer transitions 0/747 dead transitions. [2023-11-29 05:25:59,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 747 transitions, 1540 flow [2023-11-29 05:25:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:25:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:25:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2288 transitions. [2023-11-29 05:25:59,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2023-11-29 05:25:59,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2288 transitions. [2023-11-29 05:25:59,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2288 transitions. [2023-11-29 05:25:59,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:59,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2288 transitions. [2023-11-29 05:25:59,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 762.6666666666666) internal successors, (2288), 3 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:59,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:59,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:59,595 INFO L175 Difference]: Start difference. First operand has 729 places, 748 transitions, 1504 flow. Second operand 3 states and 2288 transitions. [2023-11-29 05:25:59,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 747 transitions, 1540 flow [2023-11-29 05:25:59,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 747 transitions, 1536 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:25:59,615 INFO L231 Difference]: Finished difference. Result has 726 places, 747 transitions, 1502 flow [2023-11-29 05:25:59,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=724, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=726, PETRI_TRANSITIONS=747} [2023-11-29 05:25:59,618 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -6 predicate places. [2023-11-29 05:25:59,618 INFO L495 AbstractCegarLoop]: Abstraction has has 726 places, 747 transitions, 1502 flow [2023-11-29 05:25:59,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:59,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:59,621 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] [2023-11-29 05:25:59,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:25:59,622 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:25:59,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2051794516, now seen corresponding path program 1 times [2023-11-29 05:25:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655663800] [2023-11-29 05:25:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:59,683 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-29 05:25:59,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:59,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655663800] [2023-11-29 05:25:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655663800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:59,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:59,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:25:59,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834744458] [2023-11-29 05:25:59,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:59,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:59,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:59,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:59,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:59,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:25:59,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 747 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:59,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:59,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:25:59,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:00,363 INFO L124 PetriNetUnfolderBase]: 130/3002 cut-off events. [2023-11-29 05:26:00,363 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-29 05:26:00,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 3002 events. 130/3002 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 18535 event pairs, 8 based on Foata normal form. 0/2381 useless extension candidates. Maximal degree in co-relation 3008. Up to 34 conditions per place. [2023-11-29 05:26:00,405 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 2 changer transitions 0/746 dead transitions. [2023-11-29 05:26:00,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 746 transitions, 1538 flow [2023-11-29 05:26:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2288 transitions. [2023-11-29 05:26:00,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2023-11-29 05:26:00,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2288 transitions. [2023-11-29 05:26:00,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2288 transitions. [2023-11-29 05:26:00,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:00,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2288 transitions. [2023-11-29 05:26:00,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 762.6666666666666) internal successors, (2288), 3 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,431 INFO L175 Difference]: Start difference. First operand has 726 places, 747 transitions, 1502 flow. Second operand 3 states and 2288 transitions. [2023-11-29 05:26:00,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 746 transitions, 1538 flow [2023-11-29 05:26:00,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 746 transitions, 1534 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:00,447 INFO L231 Difference]: Finished difference. Result has 725 places, 746 transitions, 1500 flow [2023-11-29 05:26:00,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=725, PETRI_TRANSITIONS=746} [2023-11-29 05:26:00,449 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -7 predicate places. [2023-11-29 05:26:00,449 INFO L495 AbstractCegarLoop]: Abstraction has has 725 places, 746 transitions, 1500 flow [2023-11-29 05:26:00,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:00,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:00,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:26:00,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:00,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1145381114, now seen corresponding path program 1 times [2023-11-29 05:26:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:00,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119047340] [2023-11-29 05:26:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:00,501 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-29 05:26:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119047340] [2023-11-29 05:26:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119047340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:00,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187136366] [2023-11-29 05:26:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:00,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:00,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:00,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 760 out of 792 [2023-11-29 05:26:00,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 746 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 761.3333333333334) internal successors, (2284), 3 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:00,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 760 of 792 [2023-11-29 05:26:00,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:00,808 INFO L124 PetriNetUnfolderBase]: 44/1019 cut-off events. [2023-11-29 05:26:00,808 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 05:26:00,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 1019 events. 44/1019 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3963 event pairs, 6 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 1007. Up to 26 conditions per place. [2023-11-29 05:26:00,862 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 13 selfloop transitions, 2 changer transitions 0/745 dead transitions. [2023-11-29 05:26:00,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 745 transitions, 1528 flow [2023-11-29 05:26:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2023-11-29 05:26:00,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9663299663299664 [2023-11-29 05:26:00,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2023-11-29 05:26:00,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2023-11-29 05:26:00,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:00,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2023-11-29 05:26:00,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,888 INFO L175 Difference]: Start difference. First operand has 725 places, 746 transitions, 1500 flow. Second operand 3 states and 2296 transitions. [2023-11-29 05:26:00,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 745 transitions, 1528 flow [2023-11-29 05:26:00,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 745 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:00,905 INFO L231 Difference]: Finished difference. Result has 724 places, 745 transitions, 1498 flow [2023-11-29 05:26:00,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1498, PETRI_PLACES=724, PETRI_TRANSITIONS=745} [2023-11-29 05:26:00,907 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -8 predicate places. [2023-11-29 05:26:00,908 INFO L495 AbstractCegarLoop]: Abstraction has has 724 places, 745 transitions, 1498 flow [2023-11-29 05:26:00,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 761.3333333333334) internal successors, (2284), 3 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:00,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:00,910 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] [2023-11-29 05:26:00,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:26:00,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:00,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1646544512, now seen corresponding path program 1 times [2023-11-29 05:26:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:00,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639242360] [2023-11-29 05:26:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:00,970 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-29 05:26:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639242360] [2023-11-29 05:26:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639242360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:00,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:00,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718574250] [2023-11-29 05:26:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:00,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:01,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 761 out of 792 [2023-11-29 05:26:01,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 745 transitions, 1498 flow. Second operand has 3 states, 3 states have (on average 762.3333333333334) internal successors, (2287), 3 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:01,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 761 of 792 [2023-11-29 05:26:01,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:01,526 INFO L124 PetriNetUnfolderBase]: 91/2154 cut-off events. [2023-11-29 05:26:01,527 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-29 05:26:01,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 2154 events. 91/2154 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10958 event pairs, 5 based on Foata normal form. 0/1718 useless extension candidates. Maximal degree in co-relation 2130. Up to 23 conditions per place. [2023-11-29 05:26:01,554 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 12 selfloop transitions, 2 changer transitions 0/744 dead transitions. [2023-11-29 05:26:01,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 744 transitions, 1524 flow [2023-11-29 05:26:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2298 transitions. [2023-11-29 05:26:01,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9671717171717171 [2023-11-29 05:26:01,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2298 transitions. [2023-11-29 05:26:01,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2298 transitions. [2023-11-29 05:26:01,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:01,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2298 transitions. [2023-11-29 05:26:01,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.0) internal successors, (2298), 3 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,592 INFO L175 Difference]: Start difference. First operand has 724 places, 745 transitions, 1498 flow. Second operand 3 states and 2298 transitions. [2023-11-29 05:26:01,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 744 transitions, 1524 flow [2023-11-29 05:26:01,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 744 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:01,610 INFO L231 Difference]: Finished difference. Result has 723 places, 744 transitions, 1496 flow [2023-11-29 05:26:01,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=723, PETRI_TRANSITIONS=744} [2023-11-29 05:26:01,613 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -9 predicate places. [2023-11-29 05:26:01,613 INFO L495 AbstractCegarLoop]: Abstraction has has 723 places, 744 transitions, 1496 flow [2023-11-29 05:26:01,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 762.3333333333334) internal successors, (2287), 3 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:01,615 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] [2023-11-29 05:26:01,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:26:01,616 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:01,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2046951991, now seen corresponding path program 1 times [2023-11-29 05:26:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383944784] [2023-11-29 05:26:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:01,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:01,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383944784] [2023-11-29 05:26:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383944784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:01,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:01,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734669252] [2023-11-29 05:26:01,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:01,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:01,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:01,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:01,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:01,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 792 [2023-11-29 05:26:01,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 744 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:01,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 792 [2023-11-29 05:26:01,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:02,467 INFO L124 PetriNetUnfolderBase]: 182/4127 cut-off events. [2023-11-29 05:26:02,468 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2023-11-29 05:26:02,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 4127 events. 182/4127 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 29067 event pairs, 12 based on Foata normal form. 0/3266 useless extension candidates. Maximal degree in co-relation 4123. Up to 44 conditions per place. [2023-11-29 05:26:02,502 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 19 selfloop transitions, 2 changer transitions 0/743 dead transitions. [2023-11-29 05:26:02,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 743 transitions, 1536 flow [2023-11-29 05:26:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2284 transitions. [2023-11-29 05:26:02,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9612794612794613 [2023-11-29 05:26:02,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2284 transitions. [2023-11-29 05:26:02,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2284 transitions. [2023-11-29 05:26:02,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:02,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2284 transitions. [2023-11-29 05:26:02,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 761.3333333333334) internal successors, (2284), 3 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,523 INFO L175 Difference]: Start difference. First operand has 723 places, 744 transitions, 1496 flow. Second operand 3 states and 2284 transitions. [2023-11-29 05:26:02,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 743 transitions, 1536 flow [2023-11-29 05:26:02,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 743 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:02,536 INFO L231 Difference]: Finished difference. Result has 722 places, 743 transitions, 1494 flow [2023-11-29 05:26:02,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=722, PETRI_TRANSITIONS=743} [2023-11-29 05:26:02,538 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -10 predicate places. [2023-11-29 05:26:02,539 INFO L495 AbstractCegarLoop]: Abstraction has has 722 places, 743 transitions, 1494 flow [2023-11-29 05:26:02,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:02,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:02,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:26:02,540 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:02,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 936775251, now seen corresponding path program 1 times [2023-11-29 05:26:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:02,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523425731] [2023-11-29 05:26:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:02,594 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-29 05:26:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:02,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523425731] [2023-11-29 05:26:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523425731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:02,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:02,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:02,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391106332] [2023-11-29 05:26:02,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:02,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:02,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:02,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:26:02,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 743 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:02,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:26:02,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:02,867 INFO L124 PetriNetUnfolderBase]: 46/1000 cut-off events. [2023-11-29 05:26:02,867 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2023-11-29 05:26:02,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 1000 events. 46/1000 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3853 event pairs, 8 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 967. Up to 35 conditions per place. [2023-11-29 05:26:02,886 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 2 changer transitions 0/742 dead transitions. [2023-11-29 05:26:02,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 742 transitions, 1530 flow [2023-11-29 05:26:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2288 transitions. [2023-11-29 05:26:02,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2023-11-29 05:26:02,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2288 transitions. [2023-11-29 05:26:02,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2288 transitions. [2023-11-29 05:26:02,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:02,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2288 transitions. [2023-11-29 05:26:02,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 762.6666666666666) internal successors, (2288), 3 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,909 INFO L175 Difference]: Start difference. First operand has 722 places, 743 transitions, 1494 flow. Second operand 3 states and 2288 transitions. [2023-11-29 05:26:02,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 742 transitions, 1530 flow [2023-11-29 05:26:02,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 742 transitions, 1526 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:02,921 INFO L231 Difference]: Finished difference. Result has 721 places, 742 transitions, 1492 flow [2023-11-29 05:26:02,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1492, PETRI_PLACES=721, PETRI_TRANSITIONS=742} [2023-11-29 05:26:02,923 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -11 predicate places. [2023-11-29 05:26:02,924 INFO L495 AbstractCegarLoop]: Abstraction has has 721 places, 742 transitions, 1492 flow [2023-11-29 05:26:02,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:02,945 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] [2023-11-29 05:26:02,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:26:02,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:02,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1978961000, now seen corresponding path program 1 times [2023-11-29 05:26:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:02,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065110372] [2023-11-29 05:26:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:02,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:03,013 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-29 05:26:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:03,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065110372] [2023-11-29 05:26:03,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065110372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:03,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:03,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:03,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809711096] [2023-11-29 05:26:03,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:03,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:03,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:03,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:03,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 760 out of 792 [2023-11-29 05:26:03,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 742 transitions, 1492 flow. Second operand has 3 states, 3 states have (on average 761.3333333333334) internal successors, (2284), 3 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:03,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 760 of 792 [2023-11-29 05:26:03,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:03,312 INFO L124 PetriNetUnfolderBase]: 44/1015 cut-off events. [2023-11-29 05:26:03,312 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2023-11-29 05:26:03,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 1015 events. 44/1015 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3696 event pairs, 6 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 965. Up to 26 conditions per place. [2023-11-29 05:26:03,342 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 13 selfloop transitions, 2 changer transitions 0/741 dead transitions. [2023-11-29 05:26:03,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 741 transitions, 1520 flow [2023-11-29 05:26:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2023-11-29 05:26:03,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9663299663299664 [2023-11-29 05:26:03,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2023-11-29 05:26:03,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2023-11-29 05:26:03,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:03,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2023-11-29 05:26:03,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,369 INFO L175 Difference]: Start difference. First operand has 721 places, 742 transitions, 1492 flow. Second operand 3 states and 2296 transitions. [2023-11-29 05:26:03,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 741 transitions, 1520 flow [2023-11-29 05:26:03,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 741 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:03,387 INFO L231 Difference]: Finished difference. Result has 720 places, 741 transitions, 1490 flow [2023-11-29 05:26:03,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=720, PETRI_TRANSITIONS=741} [2023-11-29 05:26:03,390 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -12 predicate places. [2023-11-29 05:26:03,390 INFO L495 AbstractCegarLoop]: Abstraction has has 720 places, 741 transitions, 1490 flow [2023-11-29 05:26:03,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 761.3333333333334) internal successors, (2284), 3 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:03,392 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] [2023-11-29 05:26:03,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:26:03,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:03,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1592736570, now seen corresponding path program 1 times [2023-11-29 05:26:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520777134] [2023-11-29 05:26:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:03,449 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-29 05:26:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:03,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520777134] [2023-11-29 05:26:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520777134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:03,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:03,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622507903] [2023-11-29 05:26:03,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:03,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:03,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:03,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 761 out of 792 [2023-11-29 05:26:03,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 741 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 762.3333333333334) internal successors, (2287), 3 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:03,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 761 of 792 [2023-11-29 05:26:03,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:03,720 INFO L124 PetriNetUnfolderBase]: 31/790 cut-off events. [2023-11-29 05:26:03,721 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2023-11-29 05:26:03,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 790 events. 31/790 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2677 event pairs, 5 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 729. Up to 23 conditions per place. [2023-11-29 05:26:03,742 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 12 selfloop transitions, 2 changer transitions 0/740 dead transitions. [2023-11-29 05:26:03,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 740 transitions, 1516 flow [2023-11-29 05:26:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2298 transitions. [2023-11-29 05:26:03,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9671717171717171 [2023-11-29 05:26:03,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2298 transitions. [2023-11-29 05:26:03,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2298 transitions. [2023-11-29 05:26:03,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:03,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2298 transitions. [2023-11-29 05:26:03,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.0) internal successors, (2298), 3 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,771 INFO L175 Difference]: Start difference. First operand has 720 places, 741 transitions, 1490 flow. Second operand 3 states and 2298 transitions. [2023-11-29 05:26:03,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 740 transitions, 1516 flow [2023-11-29 05:26:03,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 740 transitions, 1512 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:03,792 INFO L231 Difference]: Finished difference. Result has 719 places, 740 transitions, 1488 flow [2023-11-29 05:26:03,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=719, PETRI_TRANSITIONS=740} [2023-11-29 05:26:03,795 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -13 predicate places. [2023-11-29 05:26:03,795 INFO L495 AbstractCegarLoop]: Abstraction has has 719 places, 740 transitions, 1488 flow [2023-11-29 05:26:03,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 762.3333333333334) internal successors, (2287), 3 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:03,797 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-29 05:26:03,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:26:03,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:03,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1182480767, now seen corresponding path program 1 times [2023-11-29 05:26:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930630485] [2023-11-29 05:26:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:03,860 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-29 05:26:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930630485] [2023-11-29 05:26:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930630485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:03,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410041464] [2023-11-29 05:26:03,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:03,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:03,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:03,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:03,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:03,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 792 [2023-11-29 05:26:03,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 740 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:03,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 792 [2023-11-29 05:26:03,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:04,268 INFO L124 PetriNetUnfolderBase]: 50/1013 cut-off events. [2023-11-29 05:26:04,268 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2023-11-29 05:26:04,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 1013 events. 50/1013 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4163 event pairs, 12 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 965. Up to 44 conditions per place. [2023-11-29 05:26:04,289 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 19 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2023-11-29 05:26:04,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 739 transitions, 1528 flow [2023-11-29 05:26:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2284 transitions. [2023-11-29 05:26:04,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9612794612794613 [2023-11-29 05:26:04,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2284 transitions. [2023-11-29 05:26:04,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2284 transitions. [2023-11-29 05:26:04,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:04,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2284 transitions. [2023-11-29 05:26:04,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 761.3333333333334) internal successors, (2284), 3 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:04,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:04,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:04,314 INFO L175 Difference]: Start difference. First operand has 719 places, 740 transitions, 1488 flow. Second operand 3 states and 2284 transitions. [2023-11-29 05:26:04,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 739 transitions, 1528 flow [2023-11-29 05:26:04,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 739 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:04,332 INFO L231 Difference]: Finished difference. Result has 718 places, 739 transitions, 1486 flow [2023-11-29 05:26:04,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=718, PETRI_TRANSITIONS=739} [2023-11-29 05:26:04,334 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -14 predicate places. [2023-11-29 05:26:04,335 INFO L495 AbstractCegarLoop]: Abstraction has has 718 places, 739 transitions, 1486 flow [2023-11-29 05:26:04,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:04,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:04,336 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] [2023-11-29 05:26:04,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:26:04,336 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:04,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash -135551510, now seen corresponding path program 1 times [2023-11-29 05:26:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:04,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005653158] [2023-11-29 05:26:04,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:04,962 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-29 05:26:04,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005653158] [2023-11-29 05:26:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005653158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:26:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107148880] [2023-11-29 05:26:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:04,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:26:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:26:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:26:05,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 792 [2023-11-29 05:26:05,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 739 transitions, 1486 flow. Second operand has 6 states, 6 states have (on average 744.5) internal successors, (4467), 6 states have internal predecessors, (4467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:05,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:05,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 792 [2023-11-29 05:26:05,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:07,132 INFO L124 PetriNetUnfolderBase]: 612/8909 cut-off events. [2023-11-29 05:26:07,132 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2023-11-29 05:26:07,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9348 conditions, 8909 events. 612/8909 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 87602 event pairs, 200 based on Foata normal form. 0/7019 useless extension candidates. Maximal degree in co-relation 9241. Up to 424 conditions per place. [2023-11-29 05:26:07,274 INFO L140 encePairwiseOnDemand]: 786/792 looper letters, 28 selfloop transitions, 5 changer transitions 0/738 dead transitions. [2023-11-29 05:26:07,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 738 transitions, 1550 flow [2023-11-29 05:26:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:26:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:26:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4492 transitions. [2023-11-29 05:26:07,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9452861952861953 [2023-11-29 05:26:07,285 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4492 transitions. [2023-11-29 05:26:07,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4492 transitions. [2023-11-29 05:26:07,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:07,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4492 transitions. [2023-11-29 05:26:07,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 748.6666666666666) internal successors, (4492), 6 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,305 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,305 INFO L175 Difference]: Start difference. First operand has 718 places, 739 transitions, 1486 flow. Second operand 6 states and 4492 transitions. [2023-11-29 05:26:07,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 738 transitions, 1550 flow [2023-11-29 05:26:07,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 738 transitions, 1546 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:07,317 INFO L231 Difference]: Finished difference. Result has 720 places, 738 transitions, 1490 flow [2023-11-29 05:26:07,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=720, PETRI_TRANSITIONS=738} [2023-11-29 05:26:07,319 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -12 predicate places. [2023-11-29 05:26:07,319 INFO L495 AbstractCegarLoop]: Abstraction has has 720 places, 738 transitions, 1490 flow [2023-11-29 05:26:07,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 744.5) internal successors, (4467), 6 states have internal predecessors, (4467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:07,320 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] [2023-11-29 05:26:07,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:26:07,320 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:07,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash -369127724, now seen corresponding path program 1 times [2023-11-29 05:26:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:07,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670585714] [2023-11-29 05:26:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:07,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:07,386 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-29 05:26:07,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:07,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670585714] [2023-11-29 05:26:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670585714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:07,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:07,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6162121] [2023-11-29 05:26:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:07,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:07,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:07,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:07,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 764 out of 792 [2023-11-29 05:26:07,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 738 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:07,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 764 of 792 [2023-11-29 05:26:07,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:07,847 INFO L124 PetriNetUnfolderBase]: 52/1241 cut-off events. [2023-11-29 05:26:07,848 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-29 05:26:07,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 1241 events. 52/1241 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4404 event pairs, 3 based on Foata normal form. 0/1007 useless extension candidates. Maximal degree in co-relation 1253. Up to 18 conditions per place. [2023-11-29 05:26:07,867 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 9 selfloop transitions, 2 changer transitions 0/737 dead transitions. [2023-11-29 05:26:07,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 737 transitions, 1510 flow [2023-11-29 05:26:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2304 transitions. [2023-11-29 05:26:07,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2023-11-29 05:26:07,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2304 transitions. [2023-11-29 05:26:07,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2304 transitions. [2023-11-29 05:26:07,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:07,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2304 transitions. [2023-11-29 05:26:07,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 768.0) internal successors, (2304), 3 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,889 INFO L175 Difference]: Start difference. First operand has 720 places, 738 transitions, 1490 flow. Second operand 3 states and 2304 transitions. [2023-11-29 05:26:07,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 737 transitions, 1510 flow [2023-11-29 05:26:07,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 737 transitions, 1500 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:26:07,904 INFO L231 Difference]: Finished difference. Result has 716 places, 737 transitions, 1482 flow [2023-11-29 05:26:07,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1482, PETRI_PLACES=716, PETRI_TRANSITIONS=737} [2023-11-29 05:26:07,906 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -16 predicate places. [2023-11-29 05:26:07,907 INFO L495 AbstractCegarLoop]: Abstraction has has 716 places, 737 transitions, 1482 flow [2023-11-29 05:26:07,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:07,908 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] [2023-11-29 05:26:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:26:07,909 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:07,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1482815213, now seen corresponding path program 1 times [2023-11-29 05:26:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:07,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398987572] [2023-11-29 05:26:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:07,966 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-29 05:26:07,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398987572] [2023-11-29 05:26:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398987572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:07,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:07,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109191841] [2023-11-29 05:26:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:07,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:07,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:07,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:07,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:08,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 792 [2023-11-29 05:26:08,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 737 transitions, 1482 flow. Second operand has 3 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:08,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 792 [2023-11-29 05:26:08,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:08,269 INFO L124 PetriNetUnfolderBase]: 47/1013 cut-off events. [2023-11-29 05:26:08,269 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 05:26:08,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 1013 events. 47/1013 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3989 event pairs, 7 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 906. Up to 27 conditions per place. [2023-11-29 05:26:08,286 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 13 selfloop transitions, 2 changer transitions 0/737 dead transitions. [2023-11-29 05:26:08,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 737 transitions, 1513 flow [2023-11-29 05:26:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2302 transitions. [2023-11-29 05:26:08,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9688552188552189 [2023-11-29 05:26:08,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2302 transitions. [2023-11-29 05:26:08,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2302 transitions. [2023-11-29 05:26:08,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:08,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2302 transitions. [2023-11-29 05:26:08,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,305 INFO L175 Difference]: Start difference. First operand has 716 places, 737 transitions, 1482 flow. Second operand 3 states and 2302 transitions. [2023-11-29 05:26:08,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 737 transitions, 1513 flow [2023-11-29 05:26:08,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 737 transitions, 1509 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:08,319 INFO L231 Difference]: Finished difference. Result has 715 places, 736 transitions, 1480 flow [2023-11-29 05:26:08,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=715, PETRI_TRANSITIONS=736} [2023-11-29 05:26:08,321 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -17 predicate places. [2023-11-29 05:26:08,322 INFO L495 AbstractCegarLoop]: Abstraction has has 715 places, 736 transitions, 1480 flow [2023-11-29 05:26:08,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:08,323 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] [2023-11-29 05:26:08,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:26:08,323 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:08,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1290714829, now seen corresponding path program 1 times [2023-11-29 05:26:08,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956404220] [2023-11-29 05:26:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:08,370 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-29 05:26:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:08,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956404220] [2023-11-29 05:26:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956404220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:08,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:08,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057371675] [2023-11-29 05:26:08,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:08,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:08,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:08,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:08,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:26:08,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 736 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:08,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:26:08,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:08,711 INFO L124 PetriNetUnfolderBase]: 65/1292 cut-off events. [2023-11-29 05:26:08,711 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 05:26:08,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 1292 events. 65/1292 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6114 event pairs, 13 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 1197. Up to 45 conditions per place. [2023-11-29 05:26:08,731 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 19 selfloop transitions, 2 changer transitions 0/736 dead transitions. [2023-11-29 05:26:08,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 736 transitions, 1523 flow [2023-11-29 05:26:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2023-11-29 05:26:08,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9638047138047138 [2023-11-29 05:26:08,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2290 transitions. [2023-11-29 05:26:08,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2290 transitions. [2023-11-29 05:26:08,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:08,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2290 transitions. [2023-11-29 05:26:08,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.3333333333334) internal successors, (2290), 3 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,748 INFO L175 Difference]: Start difference. First operand has 715 places, 736 transitions, 1480 flow. Second operand 3 states and 2290 transitions. [2023-11-29 05:26:08,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 736 transitions, 1523 flow [2023-11-29 05:26:08,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 736 transitions, 1519 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:08,762 INFO L231 Difference]: Finished difference. Result has 714 places, 735 transitions, 1478 flow [2023-11-29 05:26:08,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=714, PETRI_TRANSITIONS=735} [2023-11-29 05:26:08,764 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -18 predicate places. [2023-11-29 05:26:08,764 INFO L495 AbstractCegarLoop]: Abstraction has has 714 places, 735 transitions, 1478 flow [2023-11-29 05:26:08,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:08,765 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] [2023-11-29 05:26:08,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:26:08,765 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:08,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash -464830782, now seen corresponding path program 1 times [2023-11-29 05:26:08,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:08,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887011839] [2023-11-29 05:26:08,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:08,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:08,817 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-29 05:26:08,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887011839] [2023-11-29 05:26:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887011839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:08,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:08,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097109062] [2023-11-29 05:26:08,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:08,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:08,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 792 [2023-11-29 05:26:08,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 735 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 764.0) internal successors, (2292), 3 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:08,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:08,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 792 [2023-11-29 05:26:08,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:09,066 INFO L124 PetriNetUnfolderBase]: 47/1019 cut-off events. [2023-11-29 05:26:09,066 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2023-11-29 05:26:09,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 1019 events. 47/1019 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3777 event pairs, 2 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 886. Up to 27 conditions per place. [2023-11-29 05:26:09,081 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 13 selfloop transitions, 2 changer transitions 0/735 dead transitions. [2023-11-29 05:26:09,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 735 transitions, 1509 flow [2023-11-29 05:26:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2302 transitions. [2023-11-29 05:26:09,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9688552188552189 [2023-11-29 05:26:09,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2302 transitions. [2023-11-29 05:26:09,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2302 transitions. [2023-11-29 05:26:09,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:09,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2302 transitions. [2023-11-29 05:26:09,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:09,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:09,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:09,094 INFO L175 Difference]: Start difference. First operand has 714 places, 735 transitions, 1478 flow. Second operand 3 states and 2302 transitions. [2023-11-29 05:26:09,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 735 transitions, 1509 flow [2023-11-29 05:26:09,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 735 transitions, 1505 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:09,107 INFO L231 Difference]: Finished difference. Result has 713 places, 734 transitions, 1476 flow [2023-11-29 05:26:09,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=713, PETRI_TRANSITIONS=734} [2023-11-29 05:26:09,109 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -19 predicate places. [2023-11-29 05:26:09,109 INFO L495 AbstractCegarLoop]: Abstraction has has 713 places, 734 transitions, 1476 flow [2023-11-29 05:26:09,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 764.0) internal successors, (2292), 3 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:09,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:09,110 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] [2023-11-29 05:26:09,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:26:09,110 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:09,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1154947880, now seen corresponding path program 1 times [2023-11-29 05:26:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:09,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846159147] [2023-11-29 05:26:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:09,180 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-29 05:26:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:09,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846159147] [2023-11-29 05:26:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846159147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:09,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980378442] [2023-11-29 05:26:09,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:09,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:09,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:09,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:09,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 792 [2023-11-29 05:26:09,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:09,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:09,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 792 [2023-11-29 05:26:09,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:10,076 INFO L124 PetriNetUnfolderBase]: 383/5350 cut-off events. [2023-11-29 05:26:10,077 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 05:26:10,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5666 conditions, 5350 events. 383/5350 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 41337 event pairs, 100 based on Foata normal form. 0/4275 useless extension candidates. Maximal degree in co-relation 5198. Up to 296 conditions per place. [2023-11-29 05:26:10,134 INFO L140 encePairwiseOnDemand]: 780/792 looper letters, 26 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2023-11-29 05:26:10,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 727 transitions, 1519 flow [2023-11-29 05:26:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2023-11-29 05:26:10,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9528619528619529 [2023-11-29 05:26:10,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2264 transitions. [2023-11-29 05:26:10,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2264 transitions. [2023-11-29 05:26:10,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:10,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2264 transitions. [2023-11-29 05:26:10,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,149 INFO L175 Difference]: Start difference. First operand has 713 places, 734 transitions, 1476 flow. Second operand 3 states and 2264 transitions. [2023-11-29 05:26:10,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 727 transitions, 1519 flow [2023-11-29 05:26:10,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 727 transitions, 1515 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:10,166 INFO L231 Difference]: Finished difference. Result has 704 places, 726 transitions, 1466 flow [2023-11-29 05:26:10,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=704, PETRI_TRANSITIONS=726} [2023-11-29 05:26:10,168 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -28 predicate places. [2023-11-29 05:26:10,168 INFO L495 AbstractCegarLoop]: Abstraction has has 704 places, 726 transitions, 1466 flow [2023-11-29 05:26:10,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:10,169 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] [2023-11-29 05:26:10,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:26:10,169 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:10,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:10,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1832683188, now seen corresponding path program 1 times [2023-11-29 05:26:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:10,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341458017] [2023-11-29 05:26:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:10,260 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-29 05:26:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341458017] [2023-11-29 05:26:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341458017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:10,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:10,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:26:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843558734] [2023-11-29 05:26:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:10,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:26:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:10,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:26:10,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:26:10,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 764 out of 792 [2023-11-29 05:26:10,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 726 transitions, 1466 flow. Second operand has 5 states, 5 states have (on average 766.0) internal successors, (3830), 5 states have internal predecessors, (3830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:10,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 764 of 792 [2023-11-29 05:26:10,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:10,502 INFO L124 PetriNetUnfolderBase]: 39/989 cut-off events. [2023-11-29 05:26:10,502 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-29 05:26:10,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 989 events. 39/989 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3616 event pairs, 0 based on Foata normal form. 1/828 useless extension candidates. Maximal degree in co-relation 795. Up to 6 conditions per place. [2023-11-29 05:26:10,518 INFO L140 encePairwiseOnDemand]: 785/792 looper letters, 8 selfloop transitions, 6 changer transitions 0/727 dead transitions. [2023-11-29 05:26:10,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1496 flow [2023-11-29 05:26:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:26:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:26:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3835 transitions. [2023-11-29 05:26:10,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9684343434343434 [2023-11-29 05:26:10,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3835 transitions. [2023-11-29 05:26:10,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3835 transitions. [2023-11-29 05:26:10,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:10,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3835 transitions. [2023-11-29 05:26:10,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 767.0) internal successors, (3835), 5 states have internal predecessors, (3835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 792.0) internal successors, (4752), 6 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,553 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 792.0) internal successors, (4752), 6 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,553 INFO L175 Difference]: Start difference. First operand has 704 places, 726 transitions, 1466 flow. Second operand 5 states and 3835 transitions. [2023-11-29 05:26:10,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1496 flow [2023-11-29 05:26:10,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 727 transitions, 1496 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:26:10,563 INFO L231 Difference]: Finished difference. Result has 709 places, 727 transitions, 1486 flow [2023-11-29 05:26:10,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1486, PETRI_PLACES=709, PETRI_TRANSITIONS=727} [2023-11-29 05:26:10,565 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -23 predicate places. [2023-11-29 05:26:10,565 INFO L495 AbstractCegarLoop]: Abstraction has has 709 places, 727 transitions, 1486 flow [2023-11-29 05:26:10,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 766.0) internal successors, (3830), 5 states have internal predecessors, (3830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:10,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:10,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:10,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:26:10,566 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:10,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1818983246, now seen corresponding path program 1 times [2023-11-29 05:26:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050453042] [2023-11-29 05:26:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:10,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050453042] [2023-11-29 05:26:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050453042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:26:10,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330619914] [2023-11-29 05:26:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:10,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:26:10,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:26:10,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:26:10,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:26:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:10,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:26:10,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:26:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:11,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:26:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330619914] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:26:11,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:26:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-29 05:26:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317497463] [2023-11-29 05:26:11,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:26:11,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:26:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:11,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:26:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:26:11,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 761 out of 792 [2023-11-29 05:26:11,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 727 transitions, 1486 flow. Second operand has 14 states, 14 states have (on average 763.0714285714286) internal successors, (10683), 14 states have internal predecessors, (10683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:11,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 761 of 792 [2023-11-29 05:26:11,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:11,759 INFO L124 PetriNetUnfolderBase]: 39/1006 cut-off events. [2023-11-29 05:26:11,760 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2023-11-29 05:26:11,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 1006 events. 39/1006 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3590 event pairs, 0 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 854. Up to 6 conditions per place. [2023-11-29 05:26:11,774 INFO L140 encePairwiseOnDemand]: 782/792 looper letters, 12 selfloop transitions, 13 changer transitions 0/735 dead transitions. [2023-11-29 05:26:11,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 735 transitions, 1554 flow [2023-11-29 05:26:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:26:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 05:26:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8398 transitions. [2023-11-29 05:26:11,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9639577594123049 [2023-11-29 05:26:11,788 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8398 transitions. [2023-11-29 05:26:11,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8398 transitions. [2023-11-29 05:26:11,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:11,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8398 transitions. [2023-11-29 05:26:11,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 763.4545454545455) internal successors, (8398), 11 states have internal predecessors, (8398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 792.0) internal successors, (9504), 12 states have internal predecessors, (9504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,813 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 792.0) internal successors, (9504), 12 states have internal predecessors, (9504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,813 INFO L175 Difference]: Start difference. First operand has 709 places, 727 transitions, 1486 flow. Second operand 11 states and 8398 transitions. [2023-11-29 05:26:11,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 735 transitions, 1554 flow [2023-11-29 05:26:11,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 735 transitions, 1544 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:26:11,826 INFO L231 Difference]: Finished difference. Result has 719 places, 733 transitions, 1536 flow [2023-11-29 05:26:11,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1536, PETRI_PLACES=719, PETRI_TRANSITIONS=733} [2023-11-29 05:26:11,827 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -13 predicate places. [2023-11-29 05:26:11,827 INFO L495 AbstractCegarLoop]: Abstraction has has 719 places, 733 transitions, 1536 flow [2023-11-29 05:26:11,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 763.0714285714286) internal successors, (10683), 14 states have internal predecessors, (10683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:11,829 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:11,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:26:12,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 05:26:12,030 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:12,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1940719502, now seen corresponding path program 2 times [2023-11-29 05:26:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320422574] [2023-11-29 05:26:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:12,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:12,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320422574] [2023-11-29 05:26:12,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320422574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:12,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:12,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:26:12,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424916269] [2023-11-29 05:26:12,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:12,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:26:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:26:12,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:26:13,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 792 [2023-11-29 05:26:13,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 733 transitions, 1536 flow. Second operand has 6 states, 6 states have (on average 761.1666666666666) internal successors, (4567), 6 states have internal predecessors, (4567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:13,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:13,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 792 [2023-11-29 05:26:13,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:13,302 INFO L124 PetriNetUnfolderBase]: 39/1005 cut-off events. [2023-11-29 05:26:13,302 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2023-11-29 05:26:13,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 1005 events. 39/1005 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3562 event pairs, 0 based on Foata normal form. 4/848 useless extension candidates. Maximal degree in co-relation 856. Up to 17 conditions per place. [2023-11-29 05:26:13,320 INFO L140 encePairwiseOnDemand]: 787/792 looper letters, 11 selfloop transitions, 4 changer transitions 0/732 dead transitions. [2023-11-29 05:26:13,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 732 transitions, 1564 flow [2023-11-29 05:26:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:26:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:26:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4570 transitions. [2023-11-29 05:26:13,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9617003367003367 [2023-11-29 05:26:13,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4570 transitions. [2023-11-29 05:26:13,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4570 transitions. [2023-11-29 05:26:13,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:13,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4570 transitions. [2023-11-29 05:26:13,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 761.6666666666666) internal successors, (4570), 6 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:13,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:13,351 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:13,351 INFO L175 Difference]: Start difference. First operand has 719 places, 733 transitions, 1536 flow. Second operand 6 states and 4570 transitions. [2023-11-29 05:26:13,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 732 transitions, 1564 flow [2023-11-29 05:26:13,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 732 transitions, 1552 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-29 05:26:13,372 INFO L231 Difference]: Finished difference. Result has 720 places, 732 transitions, 1530 flow [2023-11-29 05:26:13,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1530, PETRI_PLACES=720, PETRI_TRANSITIONS=732} [2023-11-29 05:26:13,374 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -12 predicate places. [2023-11-29 05:26:13,374 INFO L495 AbstractCegarLoop]: Abstraction has has 720 places, 732 transitions, 1530 flow [2023-11-29 05:26:13,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 761.1666666666666) internal successors, (4567), 6 states have internal predecessors, (4567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:13,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:13,376 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:13,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:26:13,376 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:13,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:13,377 INFO L85 PathProgramCache]: Analyzing trace with hash -791926344, now seen corresponding path program 1 times [2023-11-29 05:26:13,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:13,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110520303] [2023-11-29 05:26:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:13,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110520303] [2023-11-29 05:26:13,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110520303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:13,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:13,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:13,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830567812] [2023-11-29 05:26:13,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:13,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:13,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:13,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:13,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:13,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 792 [2023-11-29 05:26:13,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 732 transitions, 1530 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:13,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:13,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 792 [2023-11-29 05:26:13,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:14,651 INFO L124 PetriNetUnfolderBase]: 398/5573 cut-off events. [2023-11-29 05:26:14,651 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-29 05:26:14,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 5573 events. 398/5573 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43605 event pairs, 100 based on Foata normal form. 0/4527 useless extension candidates. Maximal degree in co-relation 5736. Up to 304 conditions per place. [2023-11-29 05:26:14,708 INFO L140 encePairwiseOnDemand]: 780/792 looper letters, 26 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2023-11-29 05:26:14,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 725 transitions, 1573 flow [2023-11-29 05:26:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2023-11-29 05:26:14,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9528619528619529 [2023-11-29 05:26:14,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2264 transitions. [2023-11-29 05:26:14,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2264 transitions. [2023-11-29 05:26:14,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:14,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2264 transitions. [2023-11-29 05:26:14,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:14,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:14,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:14,719 INFO L175 Difference]: Start difference. First operand has 720 places, 732 transitions, 1530 flow. Second operand 3 states and 2264 transitions. [2023-11-29 05:26:14,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 725 transitions, 1573 flow [2023-11-29 05:26:14,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 725 transitions, 1566 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:26:14,734 INFO L231 Difference]: Finished difference. Result has 709 places, 724 transitions, 1517 flow [2023-11-29 05:26:14,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1517, PETRI_PLACES=709, PETRI_TRANSITIONS=724} [2023-11-29 05:26:14,735 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -23 predicate places. [2023-11-29 05:26:14,735 INFO L495 AbstractCegarLoop]: Abstraction has has 709 places, 724 transitions, 1517 flow [2023-11-29 05:26:14,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:14,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:14,736 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:14,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:26:14,736 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:14,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash -330514348, now seen corresponding path program 1 times [2023-11-29 05:26:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821613544] [2023-11-29 05:26:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821613544] [2023-11-29 05:26:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821613544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:14,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:14,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681232151] [2023-11-29 05:26:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:14,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:14,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:14,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:26:14,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 724 transitions, 1517 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:14,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:14,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:26:14,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:15,141 INFO L124 PetriNetUnfolderBase]: 79/1514 cut-off events. [2023-11-29 05:26:15,141 INFO L125 PetriNetUnfolderBase]: For 21/22 co-relation queries the response was YES. [2023-11-29 05:26:15,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1514 events. 79/1514 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7883 event pairs, 2 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1435. Up to 67 conditions per place. [2023-11-29 05:26:15,160 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 19 selfloop transitions, 2 changer transitions 0/724 dead transitions. [2023-11-29 05:26:15,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 724 transitions, 1560 flow [2023-11-29 05:26:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2023-11-29 05:26:15,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9638047138047138 [2023-11-29 05:26:15,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2290 transitions. [2023-11-29 05:26:15,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2290 transitions. [2023-11-29 05:26:15,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:15,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2290 transitions. [2023-11-29 05:26:15,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.3333333333334) internal successors, (2290), 3 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,175 INFO L175 Difference]: Start difference. First operand has 709 places, 724 transitions, 1517 flow. Second operand 3 states and 2290 transitions. [2023-11-29 05:26:15,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 724 transitions, 1560 flow [2023-11-29 05:26:15,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 724 transitions, 1560 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:26:15,193 INFO L231 Difference]: Finished difference. Result has 710 places, 723 transitions, 1519 flow [2023-11-29 05:26:15,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1519, PETRI_PLACES=710, PETRI_TRANSITIONS=723} [2023-11-29 05:26:15,195 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -22 predicate places. [2023-11-29 05:26:15,195 INFO L495 AbstractCegarLoop]: Abstraction has has 710 places, 723 transitions, 1519 flow [2023-11-29 05:26:15,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:15,196 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:15,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:26:15,197 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:15,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash -20566730, now seen corresponding path program 1 times [2023-11-29 05:26:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:15,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684997534] [2023-11-29 05:26:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:15,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684997534] [2023-11-29 05:26:15,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684997534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:15,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:15,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408114172] [2023-11-29 05:26:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:15,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:15,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:15,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:15,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:15,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 792 [2023-11-29 05:26:15,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 723 transitions, 1519 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:15,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 792 [2023-11-29 05:26:15,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:15,819 INFO L124 PetriNetUnfolderBase]: 116/2353 cut-off events. [2023-11-29 05:26:15,819 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-11-29 05:26:15,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 2353 events. 116/2353 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 12795 event pairs, 4 based on Foata normal form. 0/1970 useless extension candidates. Maximal degree in co-relation 2287. Up to 28 conditions per place. [2023-11-29 05:26:15,845 INFO L140 encePairwiseOnDemand]: 777/792 looper letters, 17 selfloop transitions, 9 changer transitions 0/722 dead transitions. [2023-11-29 05:26:15,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 722 transitions, 1570 flow [2023-11-29 05:26:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2282 transitions. [2023-11-29 05:26:15,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9604377104377104 [2023-11-29 05:26:15,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2282 transitions. [2023-11-29 05:26:15,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2282 transitions. [2023-11-29 05:26:15,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:15,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2282 transitions. [2023-11-29 05:26:15,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,855 INFO L175 Difference]: Start difference. First operand has 710 places, 723 transitions, 1519 flow. Second operand 3 states and 2282 transitions. [2023-11-29 05:26:15,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 722 transitions, 1570 flow [2023-11-29 05:26:15,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 722 transitions, 1566 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:15,867 INFO L231 Difference]: Finished difference. Result has 705 places, 721 transitions, 1546 flow [2023-11-29 05:26:15,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1546, PETRI_PLACES=705, PETRI_TRANSITIONS=721} [2023-11-29 05:26:15,868 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -27 predicate places. [2023-11-29 05:26:15,868 INFO L495 AbstractCegarLoop]: Abstraction has has 705 places, 721 transitions, 1546 flow [2023-11-29 05:26:15,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:15,869 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:15,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:26:15,869 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:15,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1449054047, now seen corresponding path program 1 times [2023-11-29 05:26:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714231999] [2023-11-29 05:26:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714231999] [2023-11-29 05:26:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714231999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317930221] [2023-11-29 05:26:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:15,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:15,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:26:15,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 721 transitions, 1546 flow. Second operand has 3 states, 3 states have (on average 759.6666666666666) internal successors, (2279), 3 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:15,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:15,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:26:15,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:16,400 INFO L124 PetriNetUnfolderBase]: 112/2301 cut-off events. [2023-11-29 05:26:16,400 INFO L125 PetriNetUnfolderBase]: For 47/55 co-relation queries the response was YES. [2023-11-29 05:26:16,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 2301 events. 112/2301 cut-off events. For 47/55 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 14543 event pairs, 10 based on Foata normal form. 1/1932 useless extension candidates. Maximal degree in co-relation 2253. Up to 44 conditions per place. [2023-11-29 05:26:16,426 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 20 selfloop transitions, 3 changer transitions 0/721 dead transitions. [2023-11-29 05:26:16,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 721 transitions, 1593 flow [2023-11-29 05:26:16,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2294 transitions. [2023-11-29 05:26:16,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9654882154882155 [2023-11-29 05:26:16,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2294 transitions. [2023-11-29 05:26:16,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2294 transitions. [2023-11-29 05:26:16,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:16,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2294 transitions. [2023-11-29 05:26:16,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 764.6666666666666) internal successors, (2294), 3 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:16,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:16,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:16,439 INFO L175 Difference]: Start difference. First operand has 705 places, 721 transitions, 1546 flow. Second operand 3 states and 2294 transitions. [2023-11-29 05:26:16,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 721 transitions, 1593 flow [2023-11-29 05:26:16,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 721 transitions, 1584 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:26:16,451 INFO L231 Difference]: Finished difference. Result has 705 places, 720 transitions, 1541 flow [2023-11-29 05:26:16,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=705, PETRI_TRANSITIONS=720} [2023-11-29 05:26:16,453 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -27 predicate places. [2023-11-29 05:26:16,453 INFO L495 AbstractCegarLoop]: Abstraction has has 705 places, 720 transitions, 1541 flow [2023-11-29 05:26:16,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 759.6666666666666) internal successors, (2279), 3 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:16,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:16,454 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:16,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:26:16,454 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:16,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1455561605, now seen corresponding path program 1 times [2023-11-29 05:26:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664191548] [2023-11-29 05:26:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:16,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664191548] [2023-11-29 05:26:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664191548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720595413] [2023-11-29 05:26:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:16,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 792 [2023-11-29 05:26:16,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 720 transitions, 1541 flow. Second operand has 3 states, 3 states have (on average 751.6666666666666) internal successors, (2255), 3 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:16,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:16,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 792 [2023-11-29 05:26:16,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:16,965 INFO L124 PetriNetUnfolderBase]: 76/1557 cut-off events. [2023-11-29 05:26:16,965 INFO L125 PetriNetUnfolderBase]: For 20/21 co-relation queries the response was YES. [2023-11-29 05:26:16,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 1557 events. 76/1557 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 8083 event pairs, 7 based on Foata normal form. 1/1337 useless extension candidates. Maximal degree in co-relation 1504. Up to 43 conditions per place. [2023-11-29 05:26:16,996 INFO L140 encePairwiseOnDemand]: 777/792 looper letters, 13 selfloop transitions, 8 changer transitions 14/719 dead transitions. [2023-11-29 05:26:16,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 719 transitions, 1590 flow [2023-11-29 05:26:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2281 transitions. [2023-11-29 05:26:16,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.960016835016835 [2023-11-29 05:26:16,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2281 transitions. [2023-11-29 05:26:16,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2281 transitions. [2023-11-29 05:26:16,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:16,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2281 transitions. [2023-11-29 05:26:17,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,004 INFO L175 Difference]: Start difference. First operand has 705 places, 720 transitions, 1541 flow. Second operand 3 states and 2281 transitions. [2023-11-29 05:26:17,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 719 transitions, 1590 flow [2023-11-29 05:26:17,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 719 transitions, 1584 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:17,014 INFO L231 Difference]: Finished difference. Result has 700 places, 704 transitions, 1532 flow [2023-11-29 05:26:17,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1532, PETRI_PLACES=700, PETRI_TRANSITIONS=704} [2023-11-29 05:26:17,015 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -32 predicate places. [2023-11-29 05:26:17,015 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 704 transitions, 1532 flow [2023-11-29 05:26:17,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.6666666666666) internal successors, (2255), 3 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:17,016 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:17,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:26:17,016 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:17,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash -673495922, now seen corresponding path program 1 times [2023-11-29 05:26:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451778780] [2023-11-29 05:26:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:17,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:17,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451778780] [2023-11-29 05:26:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451778780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:17,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340571429] [2023-11-29 05:26:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:17,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:17,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:26:17,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 704 transitions, 1532 flow. Second operand has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:17,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:26:17,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:17,409 INFO L124 PetriNetUnfolderBase]: 75/1508 cut-off events. [2023-11-29 05:26:17,409 INFO L125 PetriNetUnfolderBase]: For 89/90 co-relation queries the response was YES. [2023-11-29 05:26:17,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 1508 events. 75/1508 cut-off events. For 89/90 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7736 event pairs, 10 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 1511. Up to 67 conditions per place. [2023-11-29 05:26:17,428 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 3 changer transitions 0/704 dead transitions. [2023-11-29 05:26:17,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 704 transitions, 1573 flow [2023-11-29 05:26:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2023-11-29 05:26:17,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9642255892255892 [2023-11-29 05:26:17,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2291 transitions. [2023-11-29 05:26:17,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2291 transitions. [2023-11-29 05:26:17,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:17,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2291 transitions. [2023-11-29 05:26:17,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,436 INFO L175 Difference]: Start difference. First operand has 700 places, 704 transitions, 1532 flow. Second operand 3 states and 2291 transitions. [2023-11-29 05:26:17,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 704 transitions, 1573 flow [2023-11-29 05:26:17,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 704 transitions, 1565 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:26:17,448 INFO L231 Difference]: Finished difference. Result has 687 places, 703 transitions, 1528 flow [2023-11-29 05:26:17,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1528, PETRI_PLACES=687, PETRI_TRANSITIONS=703} [2023-11-29 05:26:17,450 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -45 predicate places. [2023-11-29 05:26:17,450 INFO L495 AbstractCegarLoop]: Abstraction has has 687 places, 703 transitions, 1528 flow [2023-11-29 05:26:17,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:17,451 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:17,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 05:26:17,451 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:17,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash -562965314, now seen corresponding path program 1 times [2023-11-29 05:26:17,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:17,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001638455] [2023-11-29 05:26:17,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:17,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001638455] [2023-11-29 05:26:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001638455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:26:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281838353] [2023-11-29 05:26:17,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:17,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:17,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:17,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:17,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 761 out of 792 [2023-11-29 05:26:17,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 703 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 763.3333333333334) internal successors, (2290), 3 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:17,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:17,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 761 of 792 [2023-11-29 05:26:17,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:18,897 INFO L124 PetriNetUnfolderBase]: 227/4930 cut-off events. [2023-11-29 05:26:18,897 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2023-11-29 05:26:18,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 4930 events. 227/4930 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 41856 event pairs, 12 based on Foata normal form. 0/4150 useless extension candidates. Maximal degree in co-relation 5093. Up to 99 conditions per place. [2023-11-29 05:26:19,010 INFO L140 encePairwiseOnDemand]: 784/792 looper letters, 17 selfloop transitions, 4 changer transitions 0/709 dead transitions. [2023-11-29 05:26:19,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 709 transitions, 1584 flow [2023-11-29 05:26:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2023-11-29 05:26:19,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9713804713804713 [2023-11-29 05:26:19,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2023-11-29 05:26:19,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2023-11-29 05:26:19,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:19,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2023-11-29 05:26:19,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:19,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:19,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:19,025 INFO L175 Difference]: Start difference. First operand has 687 places, 703 transitions, 1528 flow. Second operand 3 states and 2308 transitions. [2023-11-29 05:26:19,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 709 transitions, 1584 flow [2023-11-29 05:26:19,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 709 transitions, 1578 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:19,041 INFO L231 Difference]: Finished difference. Result has 689 places, 707 transitions, 1562 flow [2023-11-29 05:26:19,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1562, PETRI_PLACES=689, PETRI_TRANSITIONS=707} [2023-11-29 05:26:19,042 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -43 predicate places. [2023-11-29 05:26:19,043 INFO L495 AbstractCegarLoop]: Abstraction has has 689 places, 707 transitions, 1562 flow [2023-11-29 05:26:19,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 763.3333333333334) internal successors, (2290), 3 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:19,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:19,043 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:19,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:26:19,044 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:19,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1582450780, now seen corresponding path program 1 times [2023-11-29 05:26:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573296505] [2023-11-29 05:26:19,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:19,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573296505] [2023-11-29 05:26:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573296505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982360449] [2023-11-29 05:26:19,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:19,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:19,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 792 [2023-11-29 05:26:19,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 707 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:19,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:19,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 792 [2023-11-29 05:26:19,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:20,900 INFO L124 PetriNetUnfolderBase]: 317/6450 cut-off events. [2023-11-29 05:26:20,900 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-29 05:26:20,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7099 conditions, 6450 events. 317/6450 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 56983 event pairs, 15 based on Foata normal form. 0/5501 useless extension candidates. Maximal degree in co-relation 6894. Up to 138 conditions per place. [2023-11-29 05:26:20,998 INFO L140 encePairwiseOnDemand]: 775/792 looper letters, 20 selfloop transitions, 9 changer transitions 0/704 dead transitions. [2023-11-29 05:26:20,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 704 transitions, 1615 flow [2023-11-29 05:26:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2269 transitions. [2023-11-29 05:26:21,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.95496632996633 [2023-11-29 05:26:21,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2269 transitions. [2023-11-29 05:26:21,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2269 transitions. [2023-11-29 05:26:21,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:21,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2269 transitions. [2023-11-29 05:26:21,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:21,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:21,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:21,007 INFO L175 Difference]: Start difference. First operand has 689 places, 707 transitions, 1562 flow. Second operand 3 states and 2269 transitions. [2023-11-29 05:26:21,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 704 transitions, 1615 flow [2023-11-29 05:26:21,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 704 transitions, 1611 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:26:21,018 INFO L231 Difference]: Finished difference. Result has 684 places, 703 transitions, 1594 flow [2023-11-29 05:26:21,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1594, PETRI_PLACES=684, PETRI_TRANSITIONS=703} [2023-11-29 05:26:21,019 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -48 predicate places. [2023-11-29 05:26:21,019 INFO L495 AbstractCegarLoop]: Abstraction has has 684 places, 703 transitions, 1594 flow [2023-11-29 05:26:21,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:21,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:21,020 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:21,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 05:26:21,021 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:21,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash 519825515, now seen corresponding path program 1 times [2023-11-29 05:26:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421681205] [2023-11-29 05:26:21,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:21,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:21,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421681205] [2023-11-29 05:26:21,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421681205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:21,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:21,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:21,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344327880] [2023-11-29 05:26:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:21,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:21,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:21,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:21,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:26:21,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 703 transitions, 1594 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:21,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:21,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:26:21,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:22,523 INFO L124 PetriNetUnfolderBase]: 298/6322 cut-off events. [2023-11-29 05:26:22,523 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2023-11-29 05:26:22,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7020 conditions, 6322 events. 298/6322 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 60753 event pairs, 32 based on Foata normal form. 0/5368 useless extension candidates. Maximal degree in co-relation 6814. Up to 122 conditions per place. [2023-11-29 05:26:22,628 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 21 selfloop transitions, 3 changer transitions 0/703 dead transitions. [2023-11-29 05:26:22,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 703 transitions, 1643 flow [2023-11-29 05:26:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2023-11-29 05:26:22,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9633838383838383 [2023-11-29 05:26:22,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2289 transitions. [2023-11-29 05:26:22,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2289 transitions. [2023-11-29 05:26:22,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:22,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2289 transitions. [2023-11-29 05:26:22,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.0) internal successors, (2289), 3 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:22,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:22,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:22,635 INFO L175 Difference]: Start difference. First operand has 684 places, 703 transitions, 1594 flow. Second operand 3 states and 2289 transitions. [2023-11-29 05:26:22,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 703 transitions, 1643 flow [2023-11-29 05:26:22,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 703 transitions, 1625 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:22,647 INFO L231 Difference]: Finished difference. Result has 683 places, 702 transitions, 1580 flow [2023-11-29 05:26:22,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1580, PETRI_PLACES=683, PETRI_TRANSITIONS=702} [2023-11-29 05:26:22,648 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -49 predicate places. [2023-11-29 05:26:22,648 INFO L495 AbstractCegarLoop]: Abstraction has has 683 places, 702 transitions, 1580 flow [2023-11-29 05:26:22,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:22,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:22,649 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:22,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 05:26:22,649 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:22,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:22,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1632160671, now seen corresponding path program 1 times [2023-11-29 05:26:22,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:22,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929054451] [2023-11-29 05:26:22,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929054451] [2023-11-29 05:26:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929054451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:22,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894360233] [2023-11-29 05:26:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:22,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:22,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 792 [2023-11-29 05:26:22,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 702 transitions, 1580 flow. Second operand has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:22,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:22,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 792 [2023-11-29 05:26:22,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:24,263 INFO L124 PetriNetUnfolderBase]: 318/5848 cut-off events. [2023-11-29 05:26:24,263 INFO L125 PetriNetUnfolderBase]: For 90/92 co-relation queries the response was YES. [2023-11-29 05:26:24,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6640 conditions, 5848 events. 318/5848 cut-off events. For 90/92 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 56404 event pairs, 16 based on Foata normal form. 0/5025 useless extension candidates. Maximal degree in co-relation 6434. Up to 262 conditions per place. [2023-11-29 05:26:24,357 INFO L140 encePairwiseOnDemand]: 775/792 looper letters, 20 selfloop transitions, 9 changer transitions 0/699 dead transitions. [2023-11-29 05:26:24,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 699 transitions, 1633 flow [2023-11-29 05:26:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2269 transitions. [2023-11-29 05:26:24,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.95496632996633 [2023-11-29 05:26:24,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2269 transitions. [2023-11-29 05:26:24,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2269 transitions. [2023-11-29 05:26:24,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:24,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2269 transitions. [2023-11-29 05:26:24,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:24,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:24,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:24,365 INFO L175 Difference]: Start difference. First operand has 683 places, 702 transitions, 1580 flow. Second operand 3 states and 2269 transitions. [2023-11-29 05:26:24,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 699 transitions, 1633 flow [2023-11-29 05:26:24,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 699 transitions, 1627 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:24,376 INFO L231 Difference]: Finished difference. Result has 677 places, 698 transitions, 1610 flow [2023-11-29 05:26:24,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=677, PETRI_TRANSITIONS=698} [2023-11-29 05:26:24,377 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -55 predicate places. [2023-11-29 05:26:24,377 INFO L495 AbstractCegarLoop]: Abstraction has has 677 places, 698 transitions, 1610 flow [2023-11-29 05:26:24,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:24,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:24,378 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:24,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 05:26:24,378 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:24,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash -348881382, now seen corresponding path program 1 times [2023-11-29 05:26:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195961462] [2023-11-29 05:26:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:24,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195961462] [2023-11-29 05:26:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195961462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:24,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:24,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632204042] [2023-11-29 05:26:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:24,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:24,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:24,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:26:24,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 698 transitions, 1610 flow. Second operand has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:24,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:24,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:26:24,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:26,000 INFO L124 PetriNetUnfolderBase]: 300/5818 cut-off events. [2023-11-29 05:26:26,001 INFO L125 PetriNetUnfolderBase]: For 374/376 co-relation queries the response was YES. [2023-11-29 05:26:26,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 5818 events. 300/5818 cut-off events. For 374/376 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 55530 event pairs, 35 based on Foata normal form. 0/5013 useless extension candidates. Maximal degree in co-relation 6554. Up to 235 conditions per place. [2023-11-29 05:26:26,125 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 21 selfloop transitions, 3 changer transitions 0/698 dead transitions. [2023-11-29 05:26:26,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 698 transitions, 1659 flow [2023-11-29 05:26:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2023-11-29 05:26:26,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9633838383838383 [2023-11-29 05:26:26,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2289 transitions. [2023-11-29 05:26:26,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2289 transitions. [2023-11-29 05:26:26,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:26,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2289 transitions. [2023-11-29 05:26:26,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.0) internal successors, (2289), 3 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:26,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:26,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:26,136 INFO L175 Difference]: Start difference. First operand has 677 places, 698 transitions, 1610 flow. Second operand 3 states and 2289 transitions. [2023-11-29 05:26:26,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 698 transitions, 1659 flow [2023-11-29 05:26:26,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 698 transitions, 1641 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:26,154 INFO L231 Difference]: Finished difference. Result has 676 places, 697 transitions, 1596 flow [2023-11-29 05:26:26,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1596, PETRI_PLACES=676, PETRI_TRANSITIONS=697} [2023-11-29 05:26:26,155 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -56 predicate places. [2023-11-29 05:26:26,155 INFO L495 AbstractCegarLoop]: Abstraction has has 676 places, 697 transitions, 1596 flow [2023-11-29 05:26:26,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:26,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:26,156 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:26,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 05:26:26,157 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:26,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:26,157 INFO L85 PathProgramCache]: Analyzing trace with hash 965610695, now seen corresponding path program 1 times [2023-11-29 05:26:26,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:26,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813301851] [2023-11-29 05:26:26,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:26,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813301851] [2023-11-29 05:26:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813301851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:26,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578977395] [2023-11-29 05:26:26,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:26,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:26,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:26,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:26,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:26:26,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 697 transitions, 1596 flow. Second operand has 3 states, 3 states have (on average 759.6666666666666) internal successors, (2279), 3 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:26,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:26,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:26:26,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:27,898 INFO L124 PetriNetUnfolderBase]: 263/5752 cut-off events. [2023-11-29 05:26:27,898 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 05:26:27,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6496 conditions, 5752 events. 263/5752 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 54950 event pairs, 9 based on Foata normal form. 0/5008 useless extension candidates. Maximal degree in co-relation 6289. Up to 106 conditions per place. [2023-11-29 05:26:28,019 INFO L140 encePairwiseOnDemand]: 785/792 looper letters, 12 selfloop transitions, 3 changer transitions 0/694 dead transitions. [2023-11-29 05:26:28,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 694 transitions, 1621 flow [2023-11-29 05:26:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2293 transitions. [2023-11-29 05:26:28,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9650673400673401 [2023-11-29 05:26:28,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2293 transitions. [2023-11-29 05:26:28,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2293 transitions. [2023-11-29 05:26:28,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:28,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2293 transitions. [2023-11-29 05:26:28,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:28,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:28,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:28,027 INFO L175 Difference]: Start difference. First operand has 676 places, 697 transitions, 1596 flow. Second operand 3 states and 2293 transitions. [2023-11-29 05:26:28,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 694 transitions, 1621 flow [2023-11-29 05:26:28,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 694 transitions, 1615 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:28,044 INFO L231 Difference]: Finished difference. Result has 672 places, 693 transitions, 1588 flow [2023-11-29 05:26:28,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=670, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1588, PETRI_PLACES=672, PETRI_TRANSITIONS=693} [2023-11-29 05:26:28,046 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -60 predicate places. [2023-11-29 05:26:28,046 INFO L495 AbstractCegarLoop]: Abstraction has has 672 places, 693 transitions, 1588 flow [2023-11-29 05:26:28,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 759.6666666666666) internal successors, (2279), 3 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:28,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:28,047 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:28,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 05:26:28,047 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:28,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1085936180, now seen corresponding path program 1 times [2023-11-29 05:26:28,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763971128] [2023-11-29 05:26:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:28,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763971128] [2023-11-29 05:26:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763971128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:28,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348437516] [2023-11-29 05:26:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:28,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:28,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:28,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:28,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:26:28,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 693 transitions, 1588 flow. Second operand has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:28,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:28,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:26:28,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:29,498 INFO L124 PetriNetUnfolderBase]: 291/5724 cut-off events. [2023-11-29 05:26:29,498 INFO L125 PetriNetUnfolderBase]: For 56/58 co-relation queries the response was YES. [2023-11-29 05:26:29,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6514 conditions, 5724 events. 291/5724 cut-off events. For 56/58 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 53830 event pairs, 12 based on Foata normal form. 0/5013 useless extension candidates. Maximal degree in co-relation 6307. Up to 162 conditions per place. [2023-11-29 05:26:29,596 INFO L140 encePairwiseOnDemand]: 785/792 looper letters, 12 selfloop transitions, 3 changer transitions 0/690 dead transitions. [2023-11-29 05:26:29,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 690 transitions, 1613 flow [2023-11-29 05:26:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2293 transitions. [2023-11-29 05:26:29,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9650673400673401 [2023-11-29 05:26:29,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2293 transitions. [2023-11-29 05:26:29,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2293 transitions. [2023-11-29 05:26:29,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:29,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2293 transitions. [2023-11-29 05:26:29,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:29,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:29,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:29,602 INFO L175 Difference]: Start difference. First operand has 672 places, 693 transitions, 1588 flow. Second operand 3 states and 2293 transitions. [2023-11-29 05:26:29,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 690 transitions, 1613 flow [2023-11-29 05:26:29,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 690 transitions, 1607 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:29,613 INFO L231 Difference]: Finished difference. Result has 668 places, 689 transitions, 1580 flow [2023-11-29 05:26:29,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1580, PETRI_PLACES=668, PETRI_TRANSITIONS=689} [2023-11-29 05:26:29,614 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -64 predicate places. [2023-11-29 05:26:29,614 INFO L495 AbstractCegarLoop]: Abstraction has has 668 places, 689 transitions, 1580 flow [2023-11-29 05:26:29,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:29,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:29,615 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:29,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 05:26:29,615 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:29,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:29,616 INFO L85 PathProgramCache]: Analyzing trace with hash 163341191, now seen corresponding path program 1 times [2023-11-29 05:26:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:29,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959672659] [2023-11-29 05:26:29,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:29,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:29,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959672659] [2023-11-29 05:26:29,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959672659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:29,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:29,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:29,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253111513] [2023-11-29 05:26:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:29,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:29,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:29,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:29,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:29,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 766 out of 792 [2023-11-29 05:26:29,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 689 transitions, 1580 flow. Second operand has 3 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:29,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:29,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 766 of 792 [2023-11-29 05:26:29,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:32,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][535], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,105 INFO L294 olderBase$Statistics]: this new event has 378 ancestors and is cut-off event [2023-11-29 05:26:32,105 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:32,105 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-29 05:26:32,105 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:32,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][535], [632#L55-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 637#L76-2true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,106 INFO L294 olderBase$Statistics]: this new event has 379 ancestors and is cut-off event [2023-11-29 05:26:32,106 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-29 05:26:32,106 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-29 05:26:32,106 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-29 05:26:32,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,109 INFO L294 olderBase$Statistics]: this new event has 378 ancestors and is cut-off event [2023-11-29 05:26:32,110 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:32,110 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-29 05:26:32,110 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:32,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), 419#L55-2true, Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,127 INFO L294 olderBase$Statistics]: this new event has 379 ancestors and is cut-off event [2023-11-29 05:26:32,127 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-29 05:26:32,127 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-29 05:26:32,127 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-29 05:26:32,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][535], [632#L55-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 637#L76-2true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,153 INFO L294 olderBase$Statistics]: this new event has 382 ancestors and is cut-off event [2023-11-29 05:26:32,153 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2023-11-29 05:26:32,153 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:32,153 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2023-11-29 05:26:32,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][535], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,154 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:32,154 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,154 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,154 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:32,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][535], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,155 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:32,155 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,155 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:32,155 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][535], [632#L55-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 637#L76-2true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,155 INFO L294 olderBase$Statistics]: this new event has 382 ancestors and is cut-off event [2023-11-29 05:26:32,155 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2023-11-29 05:26:32,155 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:32,155 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2023-11-29 05:26:32,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,158 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:32,158 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:32,158 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,158 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,160 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:32,160 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:32,161 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,161 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), 419#L55-2true, Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,173 INFO L294 olderBase$Statistics]: this new event has 382 ancestors and is cut-off event [2023-11-29 05:26:32,173 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2023-11-29 05:26:32,173 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:32,173 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2023-11-29 05:26:32,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 419#L55-2true, Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,175 INFO L294 olderBase$Statistics]: this new event has 382 ancestors and is cut-off event [2023-11-29 05:26:32,175 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:32,175 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2023-11-29 05:26:32,175 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2023-11-29 05:26:32,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][535], [632#L55-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 637#L76-2true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,198 INFO L294 olderBase$Statistics]: this new event has 385 ancestors and is cut-off event [2023-11-29 05:26:32,198 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2023-11-29 05:26:32,198 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,198 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2023-11-29 05:26:32,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][535], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,198 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 05:26:32,199 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:32,199 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-29 05:26:32,199 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:32,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,202 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 05:26:32,202 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:32,202 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:32,202 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-29 05:26:32,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 419#L55-2true, Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,215 INFO L294 olderBase$Statistics]: this new event has 385 ancestors and is cut-off event [2023-11-29 05:26:32,216 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2023-11-29 05:26:32,216 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:32,216 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2023-11-29 05:26:32,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][536], [395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,308 INFO L294 olderBase$Statistics]: this new event has 401 ancestors and is cut-off event [2023-11-29 05:26:32,308 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-29 05:26:32,308 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-29 05:26:32,308 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2023-11-29 05:26:32,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][536], [Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 637#L76-2true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,309 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2023-11-29 05:26:32,309 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-29 05:26:32,309 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2023-11-29 05:26:32,309 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-29 05:26:32,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][536], [Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 637#L76-2true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,335 INFO L294 olderBase$Statistics]: this new event has 405 ancestors and is cut-off event [2023-11-29 05:26:32,335 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-29 05:26:32,335 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-29 05:26:32,335 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-29 05:26:32,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][536], [395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,335 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2023-11-29 05:26:32,335 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-29 05:26:32,335 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-29 05:26:32,335 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-29 05:26:32,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,368 INFO L294 olderBase$Statistics]: this new event has 401 ancestors and is cut-off event [2023-11-29 05:26:32,368 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2023-11-29 05:26:32,368 INFO L297 olderBase$Statistics]: existing Event has 401 ancestors and is cut-off event [2023-11-29 05:26:32,369 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2023-11-29 05:26:32,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][529], [395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 1936#(= |#race~i_8~0| 0), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:32,389 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2023-11-29 05:26:32,389 INFO L297 olderBase$Statistics]: existing Event has 408 ancestors and is cut-off event [2023-11-29 05:26:32,389 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2023-11-29 05:26:32,389 INFO L297 olderBase$Statistics]: existing Event has 408 ancestors and is cut-off event [2023-11-29 05:26:32,458 INFO L124 PetriNetUnfolderBase]: 565/10748 cut-off events. [2023-11-29 05:26:32,459 INFO L125 PetriNetUnfolderBase]: For 40/42 co-relation queries the response was YES. [2023-11-29 05:26:32,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12081 conditions, 10748 events. 565/10748 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 108561 event pairs, 22 based on Foata normal form. 0/9412 useless extension candidates. Maximal degree in co-relation 11875. Up to 298 conditions per place. [2023-11-29 05:26:32,627 INFO L140 encePairwiseOnDemand]: 788/792 looper letters, 10 selfloop transitions, 2 changer transitions 0/691 dead transitions. [2023-11-29 05:26:32,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 691 transitions, 1610 flow [2023-11-29 05:26:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2312 transitions. [2023-11-29 05:26:32,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9730639730639731 [2023-11-29 05:26:32,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2312 transitions. [2023-11-29 05:26:32,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2312 transitions. [2023-11-29 05:26:32,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:32,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2312 transitions. [2023-11-29 05:26:32,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 770.6666666666666) internal successors, (2312), 3 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:32,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:32,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:32,633 INFO L175 Difference]: Start difference. First operand has 668 places, 689 transitions, 1580 flow. Second operand 3 states and 2312 transitions. [2023-11-29 05:26:32,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 691 transitions, 1610 flow [2023-11-29 05:26:32,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 691 transitions, 1604 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:32,645 INFO L231 Difference]: Finished difference. Result has 667 places, 689 transitions, 1584 flow [2023-11-29 05:26:32,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1570, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=667, PETRI_TRANSITIONS=689} [2023-11-29 05:26:32,646 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -65 predicate places. [2023-11-29 05:26:32,647 INFO L495 AbstractCegarLoop]: Abstraction has has 667 places, 689 transitions, 1584 flow [2023-11-29 05:26:32,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:32,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:32,647 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:32,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 05:26:32,648 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:32,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1764253489, now seen corresponding path program 1 times [2023-11-29 05:26:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606174845] [2023-11-29 05:26:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606174845] [2023-11-29 05:26:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606174845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:32,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:32,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591976601] [2023-11-29 05:26:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:32,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:32,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:32,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:32,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:26:32,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 689 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:32,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:32,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:26:32,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:35,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:35,165 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:35,165 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:35,165 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:35,165 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:35,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:35,165 INFO L294 olderBase$Statistics]: this new event has 378 ancestors and is cut-off event [2023-11-29 05:26:35,165 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:35,166 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:35,166 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-29 05:26:35,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:35,259 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 05:26:35,260 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:35,260 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-29 05:26:35,260 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:35,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1853] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:35,260 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:35,260 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:35,260 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:35,260 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:36,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][534], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1943#true, Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:36,178 INFO L294 olderBase$Statistics]: this new event has 378 ancestors and is cut-off event [2023-11-29 05:26:36,178 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:36,178 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2023-11-29 05:26:36,178 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-29 05:26:36,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][534], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1943#true, Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:36,229 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:36,229 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:36,229 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:36,230 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:36,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][534], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:36,231 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:36,231 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:36,231 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:36,231 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:36,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][534], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:36,282 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 05:26:36,282 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:36,282 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:36,282 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-29 05:26:36,603 INFO L124 PetriNetUnfolderBase]: 706/15743 cut-off events. [2023-11-29 05:26:36,604 INFO L125 PetriNetUnfolderBase]: For 116/128 co-relation queries the response was YES. [2023-11-29 05:26:36,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17756 conditions, 15743 events. 706/15743 cut-off events. For 116/128 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 176501 event pairs, 63 based on Foata normal form. 4/13965 useless extension candidates. Maximal degree in co-relation 17549. Up to 356 conditions per place. [2023-11-29 05:26:36,814 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 3 changer transitions 0/689 dead transitions. [2023-11-29 05:26:36,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 689 transitions, 1625 flow [2023-11-29 05:26:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2023-11-29 05:26:36,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9642255892255892 [2023-11-29 05:26:36,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2291 transitions. [2023-11-29 05:26:36,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2291 transitions. [2023-11-29 05:26:36,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:36,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2291 transitions. [2023-11-29 05:26:36,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:36,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:36,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:36,821 INFO L175 Difference]: Start difference. First operand has 667 places, 689 transitions, 1584 flow. Second operand 3 states and 2291 transitions. [2023-11-29 05:26:36,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 689 transitions, 1625 flow [2023-11-29 05:26:36,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 689 transitions, 1625 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:26:36,834 INFO L231 Difference]: Finished difference. Result has 668 places, 688 transitions, 1588 flow [2023-11-29 05:26:36,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1588, PETRI_PLACES=668, PETRI_TRANSITIONS=688} [2023-11-29 05:26:36,836 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -64 predicate places. [2023-11-29 05:26:36,836 INFO L495 AbstractCegarLoop]: Abstraction has has 668 places, 688 transitions, 1588 flow [2023-11-29 05:26:36,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:36,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:36,837 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:36,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 05:26:36,837 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:36,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash -15269800, now seen corresponding path program 1 times [2023-11-29 05:26:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:36,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129493855] [2023-11-29 05:26:36,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:37,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:37,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129493855] [2023-11-29 05:26:37,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129493855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:37,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:37,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:26:37,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655933209] [2023-11-29 05:26:37,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:37,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:26:37,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:26:37,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:26:37,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 764 out of 792 [2023-11-29 05:26:37,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 688 transitions, 1588 flow. Second operand has 4 states, 4 states have (on average 765.75) internal successors, (3063), 4 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:37,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:37,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 764 of 792 [2023-11-29 05:26:37,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:39,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][523], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1904#true, 826#(= |#race~name_1~0| 0), 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, 1949#(= ~i_4~0 0), Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:39,062 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:39,062 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:39,062 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:39,062 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:39,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][523], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1904#true, 826#(= |#race~name_1~0| 0), 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, 1949#(= ~i_4~0 0), Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:39,095 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 05:26:39,095 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:39,095 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:39,095 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-29 05:26:39,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][523], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1947#true, Black: 1904#true, 826#(= |#race~name_1~0| 0), 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:39,534 INFO L294 olderBase$Statistics]: this new event has 470 ancestors and is cut-off event [2023-11-29 05:26:39,534 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2023-11-29 05:26:39,534 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2023-11-29 05:26:39,534 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 05:26:39,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][523], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1947#true, Black: 1904#true, 826#(= |#race~name_1~0| 0), 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1943#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:39,547 INFO L294 olderBase$Statistics]: this new event has 473 ancestors and is cut-off event [2023-11-29 05:26:39,547 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 05:26:39,547 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:39,547 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:39,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][523], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1947#true, Black: 1904#true, 826#(= |#race~name_1~0| 0), 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1943#true, Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:39,548 INFO L294 olderBase$Statistics]: this new event has 473 ancestors and is cut-off event [2023-11-29 05:26:39,548 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:39,548 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:39,548 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 05:26:39,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][523], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1947#true, Black: 1904#true, 826#(= |#race~name_1~0| 0), 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1943#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:39,561 INFO L294 olderBase$Statistics]: this new event has 476 ancestors and is cut-off event [2023-11-29 05:26:39,561 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2023-11-29 05:26:39,561 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2023-11-29 05:26:39,561 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2023-11-29 05:26:39,634 INFO L124 PetriNetUnfolderBase]: 463/10104 cut-off events. [2023-11-29 05:26:39,634 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 05:26:39,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11374 conditions, 10104 events. 463/10104 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 93467 event pairs, 26 based on Foata normal form. 0/8917 useless extension candidates. Maximal degree in co-relation 11165. Up to 159 conditions per place. [2023-11-29 05:26:39,857 INFO L140 encePairwiseOnDemand]: 784/792 looper letters, 13 selfloop transitions, 8 changer transitions 0/697 dead transitions. [2023-11-29 05:26:39,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 697 transitions, 1652 flow [2023-11-29 05:26:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:26:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:26:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3842 transitions. [2023-11-29 05:26:39,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9702020202020202 [2023-11-29 05:26:39,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3842 transitions. [2023-11-29 05:26:39,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3842 transitions. [2023-11-29 05:26:39,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:39,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3842 transitions. [2023-11-29 05:26:39,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 768.4) internal successors, (3842), 5 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:39,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 792.0) internal successors, (4752), 6 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:39,869 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 792.0) internal successors, (4752), 6 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:39,869 INFO L175 Difference]: Start difference. First operand has 668 places, 688 transitions, 1588 flow. Second operand 5 states and 3842 transitions. [2023-11-29 05:26:39,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 697 transitions, 1652 flow [2023-11-29 05:26:39,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 697 transitions, 1646 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:39,887 INFO L231 Difference]: Finished difference. Result has 673 places, 692 transitions, 1628 flow [2023-11-29 05:26:39,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1628, PETRI_PLACES=673, PETRI_TRANSITIONS=692} [2023-11-29 05:26:39,888 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -59 predicate places. [2023-11-29 05:26:39,888 INFO L495 AbstractCegarLoop]: Abstraction has has 673 places, 692 transitions, 1628 flow [2023-11-29 05:26:39,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 765.75) internal successors, (3063), 4 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:39,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:39,889 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:39,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 05:26:39,889 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:39,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash 266857156, now seen corresponding path program 1 times [2023-11-29 05:26:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:39,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531010469] [2023-11-29 05:26:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:40,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:40,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531010469] [2023-11-29 05:26:40,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531010469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:40,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:40,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:26:40,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103008256] [2023-11-29 05:26:40,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:40,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:26:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:40,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:26:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:26:40,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 792 [2023-11-29 05:26:40,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 692 transitions, 1628 flow. Second operand has 6 states, 6 states have (on average 759.5) internal successors, (4557), 6 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:40,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:40,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 792 [2023-11-29 05:26:40,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:42,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][524], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), Black: 1947#true, 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, Black: 1877#true, 1949#(= ~i_4~0 0), Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:42,686 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:42,686 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:42,687 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:42,687 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:42,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][524], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), Black: 1947#true, 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, 1949#(= ~i_4~0 0), Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:42,732 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 05:26:42,732 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:42,732 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:42,732 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-29 05:26:43,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][524], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1922#(= |#race~break_10~0| 0), Black: 1949#(= ~i_4~0 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:43,430 INFO L294 olderBase$Statistics]: this new event has 470 ancestors and is cut-off event [2023-11-29 05:26:43,430 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2023-11-29 05:26:43,430 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2023-11-29 05:26:43,430 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 05:26:43,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][524], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1922#(= |#race~break_10~0| 0), Black: 1949#(= ~i_4~0 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:43,443 INFO L294 olderBase$Statistics]: this new event has 473 ancestors and is cut-off event [2023-11-29 05:26:43,444 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 05:26:43,444 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:43,444 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:43,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][524], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1949#(= ~i_4~0 0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:43,445 INFO L294 olderBase$Statistics]: this new event has 473 ancestors and is cut-off event [2023-11-29 05:26:43,445 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:43,445 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:43,445 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 05:26:43,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][524], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1949#(= ~i_4~0 0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:43,459 INFO L294 olderBase$Statistics]: this new event has 476 ancestors and is cut-off event [2023-11-29 05:26:43,459 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2023-11-29 05:26:43,459 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2023-11-29 05:26:43,459 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2023-11-29 05:26:43,540 INFO L124 PetriNetUnfolderBase]: 473/10090 cut-off events. [2023-11-29 05:26:43,541 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-29 05:26:43,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11500 conditions, 10090 events. 473/10090 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 93314 event pairs, 17 based on Foata normal form. 0/8934 useless extension candidates. Maximal degree in co-relation 11272. Up to 159 conditions per place. [2023-11-29 05:26:43,704 INFO L140 encePairwiseOnDemand]: 786/792 looper letters, 17 selfloop transitions, 6 changer transitions 0/695 dead transitions. [2023-11-29 05:26:43,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 695 transitions, 1684 flow [2023-11-29 05:26:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:26:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:26:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4565 transitions. [2023-11-29 05:26:43,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9606481481481481 [2023-11-29 05:26:43,708 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4565 transitions. [2023-11-29 05:26:43,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4565 transitions. [2023-11-29 05:26:43,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:43,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4565 transitions. [2023-11-29 05:26:43,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 760.8333333333334) internal successors, (4565), 6 states have internal predecessors, (4565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,718 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,718 INFO L175 Difference]: Start difference. First operand has 673 places, 692 transitions, 1628 flow. Second operand 6 states and 4565 transitions. [2023-11-29 05:26:43,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 695 transitions, 1684 flow [2023-11-29 05:26:43,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 695 transitions, 1684 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:26:43,730 INFO L231 Difference]: Finished difference. Result has 677 places, 691 transitions, 1638 flow [2023-11-29 05:26:43,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1638, PETRI_PLACES=677, PETRI_TRANSITIONS=691} [2023-11-29 05:26:43,731 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -55 predicate places. [2023-11-29 05:26:43,731 INFO L495 AbstractCegarLoop]: Abstraction has has 677 places, 691 transitions, 1638 flow [2023-11-29 05:26:43,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 759.5) internal successors, (4557), 6 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:43,732 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:43,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 05:26:43,732 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:43,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:43,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1180133950, now seen corresponding path program 1 times [2023-11-29 05:26:43,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:43,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239273984] [2023-11-29 05:26:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:43,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:43,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:43,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239273984] [2023-11-29 05:26:43,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239273984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:43,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:43,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:43,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587946744] [2023-11-29 05:26:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:43,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:43,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:26:43,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 691 transitions, 1638 flow. Second operand has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:43,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:26:43,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:46,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [632#L55-1true, 395#L76-1true, Black: 1947#true, Black: 1888#(= |#race~result_3~0| 0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1964#true, Black: 1877#true, 1949#(= ~i_4~0 0), Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,133 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2023-11-29 05:26:46,133 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:46,133 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2023-11-29 05:26:46,134 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2023-11-29 05:26:46,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [632#L55-1true, 395#L76-1true, Black: 1947#true, Black: 1888#(= |#race~result_3~0| 0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1906#(= ~name_2~0 ~name_1~0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1964#true, Black: 1877#true, 1949#(= ~i_4~0 0), Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,177 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 05:26:46,177 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-29 05:26:46,177 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:46,177 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2023-11-29 05:26:46,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][416], [Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), 1897#(= |#race~result_7~0| 0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1949#(= ~i_4~0 0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1964#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 68#L85-16true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,578 INFO L294 olderBase$Statistics]: this new event has 407 ancestors and is cut-off event [2023-11-29 05:26:46,578 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is cut-off event [2023-11-29 05:26:46,578 INFO L297 olderBase$Statistics]: existing Event has 411 ancestors and is cut-off event [2023-11-29 05:26:46,578 INFO L297 olderBase$Statistics]: existing Event has 411 ancestors and is cut-off event [2023-11-29 05:26:46,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][416], [Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), 1897#(= |#race~result_7~0| 0), 170#L85-20true, Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1949#(= ~i_4~0 0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1964#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,636 INFO L294 olderBase$Statistics]: this new event has 411 ancestors and is cut-off event [2023-11-29 05:26:46,636 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is cut-off event [2023-11-29 05:26:46,636 INFO L297 olderBase$Statistics]: existing Event has 500 ancestors and is cut-off event [2023-11-29 05:26:46,636 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is cut-off event [2023-11-29 05:26:46,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][556], [Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1949#(= ~i_4~0 0), 1966#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet52#1|), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, Black: 1877#true, 720#L85-21true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,650 INFO L294 olderBase$Statistics]: this new event has 412 ancestors and is cut-off event [2023-11-29 05:26:46,650 INFO L297 olderBase$Statistics]: existing Event has 416 ancestors and is cut-off event [2023-11-29 05:26:46,650 INFO L297 olderBase$Statistics]: existing Event has 416 ancestors and is cut-off event [2023-11-29 05:26:46,650 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is cut-off event [2023-11-29 05:26:46,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][556], [Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1949#(= ~i_4~0 0), 1966#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet52#1|), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 401#L85-22true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,661 INFO L294 olderBase$Statistics]: this new event has 413 ancestors and is cut-off event [2023-11-29 05:26:46,661 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2023-11-29 05:26:46,661 INFO L297 olderBase$Statistics]: existing Event has 502 ancestors and is cut-off event [2023-11-29 05:26:46,661 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2023-11-29 05:26:46,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][416], [Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1949#(= ~i_4~0 0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 54#L87true, Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1964#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,693 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2023-11-29 05:26:46,693 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2023-11-29 05:26:46,693 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2023-11-29 05:26:46,693 INFO L297 olderBase$Statistics]: existing Event has 505 ancestors and is cut-off event [2023-11-29 05:26:46,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2309] thread1EXIT-->L109-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_6|} AuxVars[] AssignedVars[][416], [Black: 1888#(= |#race~result_3~0| 0), 1906#(= ~name_2~0 ~name_1~0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 170#L85-20true, Black: 1949#(= ~i_4~0 0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 702#L109-7true, 1875#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 1940#(= |#race~nondet_0~0| 0), Black: 1938#true, 1964#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,844 INFO L294 olderBase$Statistics]: this new event has 435 ancestors and is cut-off event [2023-11-29 05:26:46,844 INFO L297 olderBase$Statistics]: existing Event has 439 ancestors and is cut-off event [2023-11-29 05:26:46,844 INFO L297 olderBase$Statistics]: existing Event has 439 ancestors and is cut-off event [2023-11-29 05:26:46,845 INFO L297 olderBase$Statistics]: existing Event has 524 ancestors and is cut-off event [2023-11-29 05:26:46,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1906#(= ~name_2~0 ~name_1~0), Black: 1949#(= ~i_4~0 0), Black: 1922#(= |#race~break_10~0| 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1964#true, Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:46,992 INFO L294 olderBase$Statistics]: this new event has 470 ancestors and is cut-off event [2023-11-29 05:26:46,992 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 05:26:46,992 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2023-11-29 05:26:46,992 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2023-11-29 05:26:47,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1906#(= ~name_2~0 ~name_1~0), Black: 1922#(= |#race~break_10~0| 0), Black: 1949#(= ~i_4~0 0), Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1964#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:47,010 INFO L294 olderBase$Statistics]: this new event has 473 ancestors and is cut-off event [2023-11-29 05:26:47,010 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:47,010 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 05:26:47,010 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:47,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1906#(= ~name_2~0 ~name_1~0), Black: 1949#(= ~i_4~0 0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1897#(= |#race~result_7~0| 0), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1964#true, Black: 1877#true, Black: 1912#(= |#race~break_6~0| 0), Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:47,012 INFO L294 olderBase$Statistics]: this new event has 473 ancestors and is cut-off event [2023-11-29 05:26:47,012 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 05:26:47,012 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:47,012 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-11-29 05:26:47,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2129] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [632#L55-1true, 395#L76-1true, Black: 1888#(= |#race~result_3~0| 0), Black: 1952#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1906#(= ~name_2~0 ~name_1~0), Black: 1949#(= ~i_4~0 0), Black: 1920#true, Black: 837#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1897#(= |#race~result_7~0| 0), Black: 1851#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1859#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1865#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1957#true, 1947#true, 826#(= |#race~name_1~0| 0), Black: 1904#true, 515#L108-4true, Black: 1938#true, 1940#(= |#race~nondet_0~0| 0), 1964#true, Black: 1877#true, Black: 1910#true, Black: 824#true, 1879#(= |#race~name_2~0| 0)]) [2023-11-29 05:26:47,031 INFO L294 olderBase$Statistics]: this new event has 476 ancestors and is cut-off event [2023-11-29 05:26:47,032 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2023-11-29 05:26:47,032 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2023-11-29 05:26:47,032 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2023-11-29 05:26:47,132 INFO L124 PetriNetUnfolderBase]: 601/10536 cut-off events. [2023-11-29 05:26:47,132 INFO L125 PetriNetUnfolderBase]: For 436/440 co-relation queries the response was YES. [2023-11-29 05:26:47,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12400 conditions, 10536 events. 601/10536 cut-off events. For 436/440 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 103549 event pairs, 74 based on Foata normal form. 0/9291 useless extension candidates. Maximal degree in co-relation 12185. Up to 461 conditions per place. [2023-11-29 05:26:47,316 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 3 changer transitions 0/691 dead transitions. [2023-11-29 05:26:47,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 691 transitions, 1679 flow [2023-11-29 05:26:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2023-11-29 05:26:47,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9642255892255892 [2023-11-29 05:26:47,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2291 transitions. [2023-11-29 05:26:47,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2291 transitions. [2023-11-29 05:26:47,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:47,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2291 transitions. [2023-11-29 05:26:47,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:47,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:47,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:47,324 INFO L175 Difference]: Start difference. First operand has 677 places, 691 transitions, 1638 flow. Second operand 3 states and 2291 transitions. [2023-11-29 05:26:47,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 691 transitions, 1679 flow [2023-11-29 05:26:47,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 691 transitions, 1667 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:26:47,336 INFO L231 Difference]: Finished difference. Result has 673 places, 690 transitions, 1630 flow [2023-11-29 05:26:47,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1630, PETRI_PLACES=673, PETRI_TRANSITIONS=690} [2023-11-29 05:26:47,337 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -59 predicate places. [2023-11-29 05:26:47,338 INFO L495 AbstractCegarLoop]: Abstraction has has 673 places, 690 transitions, 1630 flow [2023-11-29 05:26:47,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:47,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:47,338 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:47,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 05:26:47,339 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:47,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1365849657, now seen corresponding path program 1 times [2023-11-29 05:26:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:47,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689116724] [2023-11-29 05:26:47,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689116724] [2023-11-29 05:26:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689116724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:26:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661734818] [2023-11-29 05:26:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:47,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:26:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:26:47,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:26:47,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 764 out of 792 [2023-11-29 05:26:47,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 690 transitions, 1630 flow. Second operand has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:47,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:47,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 764 of 792 [2023-11-29 05:26:47,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:51,453 INFO L124 PetriNetUnfolderBase]: 649/12838 cut-off events. [2023-11-29 05:26:51,453 INFO L125 PetriNetUnfolderBase]: For 189/193 co-relation queries the response was YES. [2023-11-29 05:26:51,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14645 conditions, 12838 events. 649/12838 cut-off events. For 189/193 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 126777 event pairs, 42 based on Foata normal form. 0/11335 useless extension candidates. Maximal degree in co-relation 14429. Up to 283 conditions per place. [2023-11-29 05:26:51,707 INFO L140 encePairwiseOnDemand]: 784/792 looper letters, 12 selfloop transitions, 8 changer transitions 0/698 dead transitions. [2023-11-29 05:26:51,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 698 transitions, 1689 flow [2023-11-29 05:26:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:26:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:26:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3841 transitions. [2023-11-29 05:26:51,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9699494949494949 [2023-11-29 05:26:51,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3841 transitions. [2023-11-29 05:26:51,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3841 transitions. [2023-11-29 05:26:51,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:51,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3841 transitions. [2023-11-29 05:26:51,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 768.2) internal successors, (3841), 5 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:51,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 792.0) internal successors, (4752), 6 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:51,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 792.0) internal successors, (4752), 6 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:51,718 INFO L175 Difference]: Start difference. First operand has 673 places, 690 transitions, 1630 flow. Second operand 5 states and 3841 transitions. [2023-11-29 05:26:51,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 698 transitions, 1689 flow [2023-11-29 05:26:51,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 698 transitions, 1683 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:51,733 INFO L231 Difference]: Finished difference. Result has 678 places, 694 transitions, 1670 flow [2023-11-29 05:26:51,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1670, PETRI_PLACES=678, PETRI_TRANSITIONS=694} [2023-11-29 05:26:51,734 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -54 predicate places. [2023-11-29 05:26:51,735 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 694 transitions, 1670 flow [2023-11-29 05:26:51,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 766.0) internal successors, (3064), 4 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:51,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:51,735 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:51,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 05:26:51,736 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:51,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1271737141, now seen corresponding path program 1 times [2023-11-29 05:26:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:51,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235199040] [2023-11-29 05:26:51,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:51,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:51,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235199040] [2023-11-29 05:26:51,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235199040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:51,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:51,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640465451] [2023-11-29 05:26:51,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:51,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:51,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 763 out of 792 [2023-11-29 05:26:51,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 694 transitions, 1670 flow. Second operand has 3 states, 3 states have (on average 764.6666666666666) internal successors, (2294), 3 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:51,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:51,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 763 of 792 [2023-11-29 05:26:51,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:55,569 INFO L124 PetriNetUnfolderBase]: 567/11782 cut-off events. [2023-11-29 05:26:55,570 INFO L125 PetriNetUnfolderBase]: For 106/108 co-relation queries the response was YES. [2023-11-29 05:26:55,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13517 conditions, 11782 events. 567/11782 cut-off events. For 106/108 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 111328 event pairs, 52 based on Foata normal form. 0/10454 useless extension candidates. Maximal degree in co-relation 13296. Up to 253 conditions per place. [2023-11-29 05:26:55,964 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 11 selfloop transitions, 2 changer transitions 0/694 dead transitions. [2023-11-29 05:26:55,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 694 transitions, 1697 flow [2023-11-29 05:26:55,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2303 transitions. [2023-11-29 05:26:55,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9692760942760943 [2023-11-29 05:26:55,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2303 transitions. [2023-11-29 05:26:55,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2303 transitions. [2023-11-29 05:26:55,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:55,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2303 transitions. [2023-11-29 05:26:55,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.6666666666666) internal successors, (2303), 3 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:55,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:55,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:55,974 INFO L175 Difference]: Start difference. First operand has 678 places, 694 transitions, 1670 flow. Second operand 3 states and 2303 transitions. [2023-11-29 05:26:55,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 694 transitions, 1697 flow [2023-11-29 05:26:55,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 694 transitions, 1697 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:26:55,992 INFO L231 Difference]: Finished difference. Result has 679 places, 693 transitions, 1672 flow [2023-11-29 05:26:55,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1672, PETRI_PLACES=679, PETRI_TRANSITIONS=693} [2023-11-29 05:26:55,994 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -53 predicate places. [2023-11-29 05:26:55,994 INFO L495 AbstractCegarLoop]: Abstraction has has 679 places, 693 transitions, 1672 flow [2023-11-29 05:26:55,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 764.6666666666666) internal successors, (2294), 3 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:55,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:55,995 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:55,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 05:26:55,995 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:26:55,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:55,995 INFO L85 PathProgramCache]: Analyzing trace with hash 396240265, now seen corresponding path program 1 times [2023-11-29 05:26:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:55,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127373469] [2023-11-29 05:26:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:26:56,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:56,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127373469] [2023-11-29 05:26:56,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127373469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:56,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:56,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:26:56,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694868101] [2023-11-29 05:26:56,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:56,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:26:56,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:56,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:26:56,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:26:56,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 792 [2023-11-29 05:26:56,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 693 transitions, 1672 flow. Second operand has 6 states, 6 states have (on average 759.6666666666666) internal successors, (4558), 6 states have internal predecessors, (4558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:56,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:56,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 792 [2023-11-29 05:26:56,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:01,829 INFO L124 PetriNetUnfolderBase]: 670/12781 cut-off events. [2023-11-29 05:27:01,829 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2023-11-29 05:27:02,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14928 conditions, 12781 events. 670/12781 cut-off events. For 292/296 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 127835 event pairs, 30 based on Foata normal form. 0/11381 useless extension candidates. Maximal degree in co-relation 14692. Up to 283 conditions per place. [2023-11-29 05:27:02,087 INFO L140 encePairwiseOnDemand]: 786/792 looper letters, 17 selfloop transitions, 6 changer transitions 0/696 dead transitions. [2023-11-29 05:27:02,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 696 transitions, 1728 flow [2023-11-29 05:27:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:27:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:27:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4565 transitions. [2023-11-29 05:27:02,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9606481481481481 [2023-11-29 05:27:02,091 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4565 transitions. [2023-11-29 05:27:02,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4565 transitions. [2023-11-29 05:27:02,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:02,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4565 transitions. [2023-11-29 05:27:02,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 760.8333333333334) internal successors, (4565), 6 states have internal predecessors, (4565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:02,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:02,100 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:02,100 INFO L175 Difference]: Start difference. First operand has 679 places, 693 transitions, 1672 flow. Second operand 6 states and 4565 transitions. [2023-11-29 05:27:02,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 696 transitions, 1728 flow [2023-11-29 05:27:02,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 696 transitions, 1724 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:02,117 INFO L231 Difference]: Finished difference. Result has 681 places, 692 transitions, 1678 flow [2023-11-29 05:27:02,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1678, PETRI_PLACES=681, PETRI_TRANSITIONS=692} [2023-11-29 05:27:02,118 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -51 predicate places. [2023-11-29 05:27:02,118 INFO L495 AbstractCegarLoop]: Abstraction has has 681 places, 692 transitions, 1678 flow [2023-11-29 05:27:02,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 759.6666666666666) internal successors, (4558), 6 states have internal predecessors, (4558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:02,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:02,119 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:02,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 05:27:02,119 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:02,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash 90275441, now seen corresponding path program 1 times [2023-11-29 05:27:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:02,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783080764] [2023-11-29 05:27:02,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:02,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783080764] [2023-11-29 05:27:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783080764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:02,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280928590] [2023-11-29 05:27:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:02,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:02,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:02,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 792 [2023-11-29 05:27:02,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 692 transitions, 1678 flow. Second operand has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:02,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:02,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 792 [2023-11-29 05:27:02,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:06,530 INFO L124 PetriNetUnfolderBase]: 653/13744 cut-off events. [2023-11-29 05:27:06,530 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2023-11-29 05:27:06,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16066 conditions, 13744 events. 653/13744 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 131805 event pairs, 26 based on Foata normal form. 0/12310 useless extension candidates. Maximal degree in co-relation 15844. Up to 313 conditions per place. [2023-11-29 05:27:06,743 INFO L140 encePairwiseOnDemand]: 786/792 looper letters, 14 selfloop transitions, 2 changer transitions 0/691 dead transitions. [2023-11-29 05:27:06,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 691 transitions, 1710 flow [2023-11-29 05:27:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2297 transitions. [2023-11-29 05:27:06,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9667508417508418 [2023-11-29 05:27:06,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2297 transitions. [2023-11-29 05:27:06,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2297 transitions. [2023-11-29 05:27:06,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:06,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2297 transitions. [2023-11-29 05:27:06,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.6666666666666) internal successors, (2297), 3 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:06,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:06,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:06,750 INFO L175 Difference]: Start difference. First operand has 681 places, 692 transitions, 1678 flow. Second operand 3 states and 2297 transitions. [2023-11-29 05:27:06,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 691 transitions, 1710 flow [2023-11-29 05:27:06,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 674 places, 691 transitions, 1698 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:27:06,762 INFO L231 Difference]: Finished difference. Result has 675 places, 689 transitions, 1668 flow [2023-11-29 05:27:06,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1668, PETRI_PLACES=675, PETRI_TRANSITIONS=689} [2023-11-29 05:27:06,763 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -57 predicate places. [2023-11-29 05:27:06,763 INFO L495 AbstractCegarLoop]: Abstraction has has 675 places, 689 transitions, 1668 flow [2023-11-29 05:27:06,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:06,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:06,764 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:06,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 05:27:06,764 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:06,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash 764791312, now seen corresponding path program 1 times [2023-11-29 05:27:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294204618] [2023-11-29 05:27:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294204618] [2023-11-29 05:27:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294204618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:06,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:06,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578802617] [2023-11-29 05:27:06,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:06,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:06,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:06,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:06,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:06,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 763 out of 792 [2023-11-29 05:27:06,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 689 transitions, 1668 flow. Second operand has 3 states, 3 states have (on average 765.0) internal successors, (2295), 3 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:06,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:06,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 763 of 792 [2023-11-29 05:27:06,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:10,346 INFO L124 PetriNetUnfolderBase]: 687/12170 cut-off events. [2023-11-29 05:27:10,346 INFO L125 PetriNetUnfolderBase]: For 256/260 co-relation queries the response was YES. [2023-11-29 05:27:10,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14345 conditions, 12170 events. 687/12170 cut-off events. For 256/260 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 122191 event pairs, 82 based on Foata normal form. 0/10901 useless extension candidates. Maximal degree in co-relation 14122. Up to 434 conditions per place. [2023-11-29 05:27:10,570 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 11 selfloop transitions, 2 changer transitions 0/689 dead transitions. [2023-11-29 05:27:10,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 689 transitions, 1695 flow [2023-11-29 05:27:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2303 transitions. [2023-11-29 05:27:10,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9692760942760943 [2023-11-29 05:27:10,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2303 transitions. [2023-11-29 05:27:10,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2303 transitions. [2023-11-29 05:27:10,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:10,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2303 transitions. [2023-11-29 05:27:10,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.6666666666666) internal successors, (2303), 3 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:10,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:10,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:10,579 INFO L175 Difference]: Start difference. First operand has 675 places, 689 transitions, 1668 flow. Second operand 3 states and 2303 transitions. [2023-11-29 05:27:10,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 689 transitions, 1695 flow [2023-11-29 05:27:10,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 689 transitions, 1693 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:27:10,592 INFO L231 Difference]: Finished difference. Result has 675 places, 688 transitions, 1668 flow [2023-11-29 05:27:10,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1668, PETRI_PLACES=675, PETRI_TRANSITIONS=688} [2023-11-29 05:27:10,593 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -57 predicate places. [2023-11-29 05:27:10,593 INFO L495 AbstractCegarLoop]: Abstraction has has 675 places, 688 transitions, 1668 flow [2023-11-29 05:27:10,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 765.0) internal successors, (2295), 3 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:10,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:10,594 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:10,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 05:27:10,594 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:10,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2123361846, now seen corresponding path program 1 times [2023-11-29 05:27:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:10,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799225928] [2023-11-29 05:27:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799225928] [2023-11-29 05:27:10,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799225928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:10,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:10,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077654707] [2023-11-29 05:27:10,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:10,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:10,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:10,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 792 [2023-11-29 05:27:10,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 688 transitions, 1668 flow. Second operand has 3 states, 3 states have (on average 761.0) internal successors, (2283), 3 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:10,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:10,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 792 [2023-11-29 05:27:10,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:13,958 INFO L124 PetriNetUnfolderBase]: 693/11979 cut-off events. [2023-11-29 05:27:13,958 INFO L125 PetriNetUnfolderBase]: For 306/310 co-relation queries the response was YES. [2023-11-29 05:27:14,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14287 conditions, 11979 events. 693/11979 cut-off events. For 306/310 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 120185 event pairs, 30 based on Foata normal form. 0/10909 useless extension candidates. Maximal degree in co-relation 14064. Up to 520 conditions per place. [2023-11-29 05:27:14,191 INFO L140 encePairwiseOnDemand]: 786/792 looper letters, 13 selfloop transitions, 2 changer transitions 0/686 dead transitions. [2023-11-29 05:27:14,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 686 transitions, 1697 flow [2023-11-29 05:27:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2023-11-29 05:27:14,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9663299663299664 [2023-11-29 05:27:14,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2023-11-29 05:27:14,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2023-11-29 05:27:14,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:14,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2023-11-29 05:27:14,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:14,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:14,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:14,199 INFO L175 Difference]: Start difference. First operand has 675 places, 688 transitions, 1668 flow. Second operand 3 states and 2296 transitions. [2023-11-29 05:27:14,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 686 transitions, 1697 flow [2023-11-29 05:27:14,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 686 transitions, 1691 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:14,214 INFO L231 Difference]: Finished difference. Result has 672 places, 685 transitions, 1666 flow [2023-11-29 05:27:14,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1666, PETRI_PLACES=672, PETRI_TRANSITIONS=685} [2023-11-29 05:27:14,216 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -60 predicate places. [2023-11-29 05:27:14,216 INFO L495 AbstractCegarLoop]: Abstraction has has 672 places, 685 transitions, 1666 flow [2023-11-29 05:27:14,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 761.0) internal successors, (2283), 3 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:14,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:14,216 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:14,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 05:27:14,217 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:14,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash 776983711, now seen corresponding path program 1 times [2023-11-29 05:27:14,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:14,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781735565] [2023-11-29 05:27:14,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:14,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:14,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:14,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781735565] [2023-11-29 05:27:14,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781735565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:14,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:14,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:14,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927845703] [2023-11-29 05:27:14,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:14,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:14,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:27:14,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 685 transitions, 1666 flow. Second operand has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:14,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:14,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:27:14,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:18,360 INFO L124 PetriNetUnfolderBase]: 825/17210 cut-off events. [2023-11-29 05:27:18,360 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-11-29 05:27:18,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20113 conditions, 17210 events. 825/17210 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 179357 event pairs, 75 based on Foata normal form. 0/15761 useless extension candidates. Maximal degree in co-relation 19889. Up to 418 conditions per place. [2023-11-29 05:27:18,642 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2023-11-29 05:27:18,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 685 transitions, 1707 flow [2023-11-29 05:27:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2023-11-29 05:27:18,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9642255892255892 [2023-11-29 05:27:18,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2291 transitions. [2023-11-29 05:27:18,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2291 transitions. [2023-11-29 05:27:18,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:18,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2291 transitions. [2023-11-29 05:27:18,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:18,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:18,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:18,822 INFO L175 Difference]: Start difference. First operand has 672 places, 685 transitions, 1666 flow. Second operand 3 states and 2291 transitions. [2023-11-29 05:27:18,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 685 transitions, 1707 flow [2023-11-29 05:27:18,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 685 transitions, 1705 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:27:18,837 INFO L231 Difference]: Finished difference. Result has 672 places, 684 transitions, 1668 flow [2023-11-29 05:27:18,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=670, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1668, PETRI_PLACES=672, PETRI_TRANSITIONS=684} [2023-11-29 05:27:18,839 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -60 predicate places. [2023-11-29 05:27:18,839 INFO L495 AbstractCegarLoop]: Abstraction has has 672 places, 684 transitions, 1668 flow [2023-11-29 05:27:18,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:18,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:18,840 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:18,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 05:27:18,840 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:18,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1274116452, now seen corresponding path program 1 times [2023-11-29 05:27:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545478664] [2023-11-29 05:27:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:18,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:18,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545478664] [2023-11-29 05:27:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545478664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662712985] [2023-11-29 05:27:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:18,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:18,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:18,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:27:18,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 684 transitions, 1668 flow. Second operand has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:18,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:18,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:27:18,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:22,256 INFO L124 PetriNetUnfolderBase]: 747/12422 cut-off events. [2023-11-29 05:27:22,256 INFO L125 PetriNetUnfolderBase]: For 634/638 co-relation queries the response was YES. [2023-11-29 05:27:22,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15116 conditions, 12422 events. 747/12422 cut-off events. For 634/638 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 125221 event pairs, 109 based on Foata normal form. 0/11380 useless extension candidates. Maximal degree in co-relation 14892. Up to 645 conditions per place. [2023-11-29 05:27:22,560 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2023-11-29 05:27:22,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 684 transitions, 1709 flow [2023-11-29 05:27:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2023-11-29 05:27:22,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9642255892255892 [2023-11-29 05:27:22,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2291 transitions. [2023-11-29 05:27:22,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2291 transitions. [2023-11-29 05:27:22,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:22,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2291 transitions. [2023-11-29 05:27:22,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:22,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:22,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:22,565 INFO L175 Difference]: Start difference. First operand has 672 places, 684 transitions, 1668 flow. Second operand 3 states and 2291 transitions. [2023-11-29 05:27:22,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 684 transitions, 1709 flow [2023-11-29 05:27:22,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 684 transitions, 1703 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:22,579 INFO L231 Difference]: Finished difference. Result has 671 places, 683 transitions, 1666 flow [2023-11-29 05:27:22,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1666, PETRI_PLACES=671, PETRI_TRANSITIONS=683} [2023-11-29 05:27:22,580 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -61 predicate places. [2023-11-29 05:27:22,580 INFO L495 AbstractCegarLoop]: Abstraction has has 671 places, 683 transitions, 1666 flow [2023-11-29 05:27:22,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:22,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:22,581 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:22,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 05:27:22,581 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:22,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1918982525, now seen corresponding path program 1 times [2023-11-29 05:27:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582934341] [2023-11-29 05:27:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:22,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:22,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582934341] [2023-11-29 05:27:22,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582934341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:22,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:22,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:27:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751637585] [2023-11-29 05:27:22,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:22,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:27:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:22,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:27:22,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:27:22,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 764 out of 792 [2023-11-29 05:27:22,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 683 transitions, 1666 flow. Second operand has 4 states, 4 states have (on average 766.25) internal successors, (3065), 4 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:22,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:22,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 764 of 792 [2023-11-29 05:27:22,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:26,200 INFO L124 PetriNetUnfolderBase]: 537/11246 cut-off events. [2023-11-29 05:27:26,200 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2023-11-29 05:27:26,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13188 conditions, 11246 events. 537/11246 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 105278 event pairs, 30 based on Foata normal form. 0/10355 useless extension candidates. Maximal degree in co-relation 12963. Up to 223 conditions per place. [2023-11-29 05:27:26,427 INFO L140 encePairwiseOnDemand]: 784/792 looper letters, 13 selfloop transitions, 8 changer transitions 0/691 dead transitions. [2023-11-29 05:27:26,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 691 transitions, 1728 flow [2023-11-29 05:27:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3842 transitions. [2023-11-29 05:27:26,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9702020202020202 [2023-11-29 05:27:26,430 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3842 transitions. [2023-11-29 05:27:26,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3842 transitions. [2023-11-29 05:27:26,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:26,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3842 transitions. [2023-11-29 05:27:26,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 768.4) internal successors, (3842), 5 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:26,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 792.0) internal successors, (4752), 6 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:26,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 792.0) internal successors, (4752), 6 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:26,435 INFO L175 Difference]: Start difference. First operand has 671 places, 683 transitions, 1666 flow. Second operand 5 states and 3842 transitions. [2023-11-29 05:27:26,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 691 transitions, 1728 flow [2023-11-29 05:27:26,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 691 transitions, 1722 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:26,447 INFO L231 Difference]: Finished difference. Result has 676 places, 686 transitions, 1702 flow [2023-11-29 05:27:26,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1702, PETRI_PLACES=676, PETRI_TRANSITIONS=686} [2023-11-29 05:27:26,447 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -56 predicate places. [2023-11-29 05:27:26,448 INFO L495 AbstractCegarLoop]: Abstraction has has 676 places, 686 transitions, 1702 flow [2023-11-29 05:27:26,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 766.25) internal successors, (3065), 4 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:26,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:26,448 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:26,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 05:27:26,449 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:26,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1523293086, now seen corresponding path program 1 times [2023-11-29 05:27:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203475887] [2023-11-29 05:27:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:26,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203475887] [2023-11-29 05:27:26,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203475887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:26,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:26,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:27:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51573602] [2023-11-29 05:27:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:26,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:27:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:27:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:27:27,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 792 [2023-11-29 05:27:27,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 686 transitions, 1702 flow. Second operand has 6 states, 6 states have (on average 761.3333333333334) internal successors, (4568), 6 states have internal predecessors, (4568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:27,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:27,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 792 [2023-11-29 05:27:27,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:29,935 INFO L124 PetriNetUnfolderBase]: 475/10250 cut-off events. [2023-11-29 05:27:29,935 INFO L125 PetriNetUnfolderBase]: For 161/165 co-relation queries the response was YES. [2023-11-29 05:27:30,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11915 conditions, 10250 events. 475/10250 cut-off events. For 161/165 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 93026 event pairs, 18 based on Foata normal form. 0/9450 useless extension candidates. Maximal degree in co-relation 11672. Up to 223 conditions per place. [2023-11-29 05:27:30,152 INFO L140 encePairwiseOnDemand]: 787/792 looper letters, 10 selfloop transitions, 4 changer transitions 0/685 dead transitions. [2023-11-29 05:27:30,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 685 transitions, 1728 flow [2023-11-29 05:27:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:27:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:27:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4569 transitions. [2023-11-29 05:27:30,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.961489898989899 [2023-11-29 05:27:30,155 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4569 transitions. [2023-11-29 05:27:30,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4569 transitions. [2023-11-29 05:27:30,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:30,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4569 transitions. [2023-11-29 05:27:30,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 761.5) internal successors, (4569), 6 states have internal predecessors, (4569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:30,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:30,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 792.0) internal successors, (5544), 7 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:30,160 INFO L175 Difference]: Start difference. First operand has 676 places, 686 transitions, 1702 flow. Second operand 6 states and 4569 transitions. [2023-11-29 05:27:30,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 685 transitions, 1728 flow [2023-11-29 05:27:30,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 685 transitions, 1728 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:27:30,170 INFO L231 Difference]: Finished difference. Result has 680 places, 685 transitions, 1708 flow [2023-11-29 05:27:30,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1708, PETRI_PLACES=680, PETRI_TRANSITIONS=685} [2023-11-29 05:27:30,170 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -52 predicate places. [2023-11-29 05:27:30,170 INFO L495 AbstractCegarLoop]: Abstraction has has 680 places, 685 transitions, 1708 flow [2023-11-29 05:27:30,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 761.3333333333334) internal successors, (4568), 6 states have internal predecessors, (4568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:30,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:30,171 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:30,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 05:27:30,171 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:30,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1605395756, now seen corresponding path program 1 times [2023-11-29 05:27:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088546820] [2023-11-29 05:27:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:30,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088546820] [2023-11-29 05:27:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088546820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496484167] [2023-11-29 05:27:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:30,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:30,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:30,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:27:30,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 685 transitions, 1708 flow. Second operand has 3 states, 3 states have (on average 758.6666666666666) internal successors, (2276), 3 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:30,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:30,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:27:30,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:34,923 INFO L124 PetriNetUnfolderBase]: 865/18369 cut-off events. [2023-11-29 05:27:34,924 INFO L125 PetriNetUnfolderBase]: For 336/338 co-relation queries the response was YES. [2023-11-29 05:27:35,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21516 conditions, 18369 events. 865/18369 cut-off events. For 336/338 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 192834 event pairs, 66 based on Foata normal form. 0/16939 useless extension candidates. Maximal degree in co-relation 21391. Up to 451 conditions per place. [2023-11-29 05:27:35,196 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 21 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2023-11-29 05:27:35,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 685 transitions, 1757 flow [2023-11-29 05:27:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2023-11-29 05:27:35,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9633838383838383 [2023-11-29 05:27:35,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2289 transitions. [2023-11-29 05:27:35,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2289 transitions. [2023-11-29 05:27:35,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:35,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2289 transitions. [2023-11-29 05:27:35,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.0) internal successors, (2289), 3 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:35,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:35,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:35,201 INFO L175 Difference]: Start difference. First operand has 680 places, 685 transitions, 1708 flow. Second operand 3 states and 2289 transitions. [2023-11-29 05:27:35,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 685 transitions, 1757 flow [2023-11-29 05:27:35,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 685 transitions, 1750 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:27:35,212 INFO L231 Difference]: Finished difference. Result has 677 places, 684 transitions, 1705 flow [2023-11-29 05:27:35,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1705, PETRI_PLACES=677, PETRI_TRANSITIONS=684} [2023-11-29 05:27:35,213 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -55 predicate places. [2023-11-29 05:27:35,213 INFO L495 AbstractCegarLoop]: Abstraction has has 677 places, 684 transitions, 1705 flow [2023-11-29 05:27:35,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.6666666666666) internal successors, (2276), 3 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:35,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:35,214 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:35,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-29 05:27:35,214 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:35,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2021295759, now seen corresponding path program 1 times [2023-11-29 05:27:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880929221] [2023-11-29 05:27:35,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:35,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:35,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:35,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880929221] [2023-11-29 05:27:35,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880929221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:35,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176829130] [2023-11-29 05:27:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:35,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:35,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:35,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:35,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:27:35,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 684 transitions, 1705 flow. Second operand has 3 states, 3 states have (on average 759.0) internal successors, (2277), 3 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:35,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:35,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:27:35,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:38,676 INFO L124 PetriNetUnfolderBase]: 737/12318 cut-off events. [2023-11-29 05:27:38,676 INFO L125 PetriNetUnfolderBase]: For 626/630 co-relation queries the response was YES. [2023-11-29 05:27:38,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14991 conditions, 12318 events. 737/12318 cut-off events. For 626/630 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 125152 event pairs, 118 based on Foata normal form. 0/11345 useless extension candidates. Maximal degree in co-relation 14760. Up to 648 conditions per place. [2023-11-29 05:27:38,953 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 21 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2023-11-29 05:27:38,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 684 transitions, 1754 flow [2023-11-29 05:27:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2023-11-29 05:27:38,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9633838383838383 [2023-11-29 05:27:38,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2289 transitions. [2023-11-29 05:27:38,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2289 transitions. [2023-11-29 05:27:38,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:38,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2289 transitions. [2023-11-29 05:27:38,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.0) internal successors, (2289), 3 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:38,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:38,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:38,958 INFO L175 Difference]: Start difference. First operand has 677 places, 684 transitions, 1705 flow. Second operand 3 states and 2289 transitions. [2023-11-29 05:27:38,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 684 transitions, 1754 flow [2023-11-29 05:27:38,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 684 transitions, 1748 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:38,968 INFO L231 Difference]: Finished difference. Result has 676 places, 683 transitions, 1703 flow [2023-11-29 05:27:38,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1703, PETRI_PLACES=676, PETRI_TRANSITIONS=683} [2023-11-29 05:27:38,969 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -56 predicate places. [2023-11-29 05:27:38,969 INFO L495 AbstractCegarLoop]: Abstraction has has 676 places, 683 transitions, 1703 flow [2023-11-29 05:27:38,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 759.0) internal successors, (2277), 3 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:38,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:38,969 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:38,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-29 05:27:38,969 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:38,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2101788996, now seen corresponding path program 1 times [2023-11-29 05:27:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764816853] [2023-11-29 05:27:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:39,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:39,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764816853] [2023-11-29 05:27:39,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764816853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:39,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:39,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:27:39,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059061762] [2023-11-29 05:27:39,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:39,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:39,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:39,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:39,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:39,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 766 out of 792 [2023-11-29 05:27:39,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 683 transitions, 1703 flow. Second operand has 3 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:39,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:39,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 766 of 792 [2023-11-29 05:27:39,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:42,094 INFO L124 PetriNetUnfolderBase]: 551/11456 cut-off events. [2023-11-29 05:27:42,095 INFO L125 PetriNetUnfolderBase]: For 221/223 co-relation queries the response was YES. [2023-11-29 05:27:42,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13552 conditions, 11456 events. 551/11456 cut-off events. For 221/223 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 103424 event pairs, 40 based on Foata normal form. 0/10595 useless extension candidates. Maximal degree in co-relation 13322. Up to 205 conditions per place. [2023-11-29 05:27:42,301 INFO L140 encePairwiseOnDemand]: 788/792 looper letters, 10 selfloop transitions, 3 changer transitions 0/686 dead transitions. [2023-11-29 05:27:42,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 686 transitions, 1736 flow [2023-11-29 05:27:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2312 transitions. [2023-11-29 05:27:42,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9730639730639731 [2023-11-29 05:27:42,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2312 transitions. [2023-11-29 05:27:42,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2312 transitions. [2023-11-29 05:27:42,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:42,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2312 transitions. [2023-11-29 05:27:42,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 770.6666666666666) internal successors, (2312), 3 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:42,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:42,306 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:42,306 INFO L175 Difference]: Start difference. First operand has 676 places, 683 transitions, 1703 flow. Second operand 3 states and 2312 transitions. [2023-11-29 05:27:42,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 686 transitions, 1736 flow [2023-11-29 05:27:42,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 686 transitions, 1730 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:42,316 INFO L231 Difference]: Finished difference. Result has 678 places, 685 transitions, 1719 flow [2023-11-29 05:27:42,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1719, PETRI_PLACES=678, PETRI_TRANSITIONS=685} [2023-11-29 05:27:42,316 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -54 predicate places. [2023-11-29 05:27:42,316 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 685 transitions, 1719 flow [2023-11-29 05:27:42,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:42,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:42,317 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:42,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-11-29 05:27:42,317 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:42,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1503721120, now seen corresponding path program 1 times [2023-11-29 05:27:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940213083] [2023-11-29 05:27:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:42,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:42,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940213083] [2023-11-29 05:27:42,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940213083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:42,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:42,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:42,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023423602] [2023-11-29 05:27:42,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:42,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:42,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:42,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:42,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:27:42,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 685 transitions, 1719 flow. Second operand has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:42,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:42,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:27:42,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:47,018 INFO L124 PetriNetUnfolderBase]: 903/19103 cut-off events. [2023-11-29 05:27:47,019 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2023-11-29 05:27:47,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22632 conditions, 19103 events. 903/19103 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 199260 event pairs, 71 based on Foata normal form. 0/17733 useless extension candidates. Maximal degree in co-relation 22400. Up to 430 conditions per place. [2023-11-29 05:27:47,399 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2023-11-29 05:27:47,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 685 transitions, 1760 flow [2023-11-29 05:27:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2023-11-29 05:27:47,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9642255892255892 [2023-11-29 05:27:47,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2291 transitions. [2023-11-29 05:27:47,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2291 transitions. [2023-11-29 05:27:47,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:47,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2291 transitions. [2023-11-29 05:27:47,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:47,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:47,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:47,404 INFO L175 Difference]: Start difference. First operand has 678 places, 685 transitions, 1719 flow. Second operand 3 states and 2291 transitions. [2023-11-29 05:27:47,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 685 transitions, 1760 flow [2023-11-29 05:27:47,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 685 transitions, 1754 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:47,416 INFO L231 Difference]: Finished difference. Result has 677 places, 684 transitions, 1717 flow [2023-11-29 05:27:47,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1717, PETRI_PLACES=677, PETRI_TRANSITIONS=684} [2023-11-29 05:27:47,417 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -55 predicate places. [2023-11-29 05:27:47,417 INFO L495 AbstractCegarLoop]: Abstraction has has 677 places, 684 transitions, 1717 flow [2023-11-29 05:27:47,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:47,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:47,417 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:47,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-11-29 05:27:47,417 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:47,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 295076481, now seen corresponding path program 1 times [2023-11-29 05:27:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483546388] [2023-11-29 05:27:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:47,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:47,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483546388] [2023-11-29 05:27:47,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483546388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:47,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:47,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:27:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755342250] [2023-11-29 05:27:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:47,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:47,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 766 out of 792 [2023-11-29 05:27:47,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 684 transitions, 1717 flow. Second operand has 3 states, 3 states have (on average 767.6666666666666) internal successors, (2303), 3 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:47,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:47,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 766 of 792 [2023-11-29 05:27:47,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:50,451 INFO L124 PetriNetUnfolderBase]: 625/11742 cut-off events. [2023-11-29 05:27:50,451 INFO L125 PetriNetUnfolderBase]: For 277/281 co-relation queries the response was YES. [2023-11-29 05:27:50,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14063 conditions, 11742 events. 625/11742 cut-off events. For 277/281 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 115254 event pairs, 59 based on Foata normal form. 0/10839 useless extension candidates. Maximal degree in co-relation 13832. Up to 317 conditions per place. [2023-11-29 05:27:50,665 INFO L140 encePairwiseOnDemand]: 788/792 looper letters, 10 selfloop transitions, 3 changer transitions 0/687 dead transitions. [2023-11-29 05:27:50,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 687 transitions, 1750 flow [2023-11-29 05:27:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2312 transitions. [2023-11-29 05:27:50,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9730639730639731 [2023-11-29 05:27:50,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2312 transitions. [2023-11-29 05:27:50,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2312 transitions. [2023-11-29 05:27:50,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:50,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2312 transitions. [2023-11-29 05:27:50,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 770.6666666666666) internal successors, (2312), 3 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:50,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:50,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:50,671 INFO L175 Difference]: Start difference. First operand has 677 places, 684 transitions, 1717 flow. Second operand 3 states and 2312 transitions. [2023-11-29 05:27:50,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 687 transitions, 1750 flow [2023-11-29 05:27:50,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 687 transitions, 1744 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:50,681 INFO L231 Difference]: Finished difference. Result has 679 places, 686 transitions, 1733 flow [2023-11-29 05:27:50,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1733, PETRI_PLACES=679, PETRI_TRANSITIONS=686} [2023-11-29 05:27:50,682 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -53 predicate places. [2023-11-29 05:27:50,682 INFO L495 AbstractCegarLoop]: Abstraction has has 679 places, 686 transitions, 1733 flow [2023-11-29 05:27:50,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 767.6666666666666) internal successors, (2303), 3 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:50,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:50,682 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:50,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-11-29 05:27:50,682 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:50,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1505984603, now seen corresponding path program 1 times [2023-11-29 05:27:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:50,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414288267] [2023-11-29 05:27:50,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:50,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414288267] [2023-11-29 05:27:50,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414288267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:50,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598685244] [2023-11-29 05:27:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:50,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:50,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:50,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 792 [2023-11-29 05:27:50,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 686 transitions, 1733 flow. Second operand has 3 states, 3 states have (on average 761.0) internal successors, (2283), 3 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:50,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:50,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 792 [2023-11-29 05:27:50,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:53,918 INFO L124 PetriNetUnfolderBase]: 741/12404 cut-off events. [2023-11-29 05:27:53,918 INFO L125 PetriNetUnfolderBase]: For 822/826 co-relation queries the response was YES. [2023-11-29 05:27:54,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15524 conditions, 12404 events. 741/12404 cut-off events. For 822/826 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 126304 event pairs, 100 based on Foata normal form. 0/11584 useless extension candidates. Maximal degree in co-relation 15291. Up to 613 conditions per place. [2023-11-29 05:27:54,122 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 17 selfloop transitions, 3 changer transitions 0/686 dead transitions. [2023-11-29 05:27:54,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 686 transitions, 1774 flow [2023-11-29 05:27:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2023-11-29 05:27:54,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9642255892255892 [2023-11-29 05:27:54,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2291 transitions. [2023-11-29 05:27:54,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2291 transitions. [2023-11-29 05:27:54,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:54,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2291 transitions. [2023-11-29 05:27:54,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:54,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:54,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:54,126 INFO L175 Difference]: Start difference. First operand has 679 places, 686 transitions, 1733 flow. Second operand 3 states and 2291 transitions. [2023-11-29 05:27:54,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 686 transitions, 1774 flow [2023-11-29 05:27:54,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 686 transitions, 1768 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:54,137 INFO L231 Difference]: Finished difference. Result has 678 places, 685 transitions, 1731 flow [2023-11-29 05:27:54,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1731, PETRI_PLACES=678, PETRI_TRANSITIONS=685} [2023-11-29 05:27:54,138 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -54 predicate places. [2023-11-29 05:27:54,138 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 685 transitions, 1731 flow [2023-11-29 05:27:54,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 761.0) internal successors, (2283), 3 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:54,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:54,138 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:54,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-11-29 05:27:54,138 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:54,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1389675439, now seen corresponding path program 1 times [2023-11-29 05:27:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982109987] [2023-11-29 05:27:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:54,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982109987] [2023-11-29 05:27:54,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982109987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:54,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:54,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:27:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435389882] [2023-11-29 05:27:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:54,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:54,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:54,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:54,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 766 out of 792 [2023-11-29 05:27:54,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 685 transitions, 1731 flow. Second operand has 3 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:54,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:54,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 766 of 792 [2023-11-29 05:27:54,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:57,346 INFO L124 PetriNetUnfolderBase]: 551/11602 cut-off events. [2023-11-29 05:27:57,346 INFO L125 PetriNetUnfolderBase]: For 235/237 co-relation queries the response was YES. [2023-11-29 05:27:57,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14008 conditions, 11602 events. 551/11602 cut-off events. For 235/237 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 104133 event pairs, 40 based on Foata normal form. 0/10832 useless extension candidates. Maximal degree in co-relation 13776. Up to 205 conditions per place. [2023-11-29 05:27:57,557 INFO L140 encePairwiseOnDemand]: 788/792 looper letters, 10 selfloop transitions, 3 changer transitions 0/688 dead transitions. [2023-11-29 05:27:57,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 688 transitions, 1764 flow [2023-11-29 05:27:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2312 transitions. [2023-11-29 05:27:57,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9730639730639731 [2023-11-29 05:27:57,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2312 transitions. [2023-11-29 05:27:57,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2312 transitions. [2023-11-29 05:27:57,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:57,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2312 transitions. [2023-11-29 05:27:57,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 770.6666666666666) internal successors, (2312), 3 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:57,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:57,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:57,562 INFO L175 Difference]: Start difference. First operand has 678 places, 685 transitions, 1731 flow. Second operand 3 states and 2312 transitions. [2023-11-29 05:27:57,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 688 transitions, 1764 flow [2023-11-29 05:27:57,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 688 transitions, 1758 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:57,573 INFO L231 Difference]: Finished difference. Result has 680 places, 687 transitions, 1747 flow [2023-11-29 05:27:57,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1747, PETRI_PLACES=680, PETRI_TRANSITIONS=687} [2023-11-29 05:27:57,574 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -52 predicate places. [2023-11-29 05:27:57,574 INFO L495 AbstractCegarLoop]: Abstraction has has 680 places, 687 transitions, 1747 flow [2023-11-29 05:27:57,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:57,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:57,574 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:57,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-11-29 05:27:57,574 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:27:57,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1349917067, now seen corresponding path program 1 times [2023-11-29 05:27:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281675254] [2023-11-29 05:27:57,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:27:57,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281675254] [2023-11-29 05:27:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281675254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:57,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:57,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117403767] [2023-11-29 05:27:57,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:57,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:57,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:57,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:27:57,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 687 transitions, 1747 flow. Second operand has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:57,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:57,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:27:57,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:03,165 INFO L124 PetriNetUnfolderBase]: 1073/23388 cut-off events. [2023-11-29 05:28:03,165 INFO L125 PetriNetUnfolderBase]: For 495/497 co-relation queries the response was YES. [2023-11-29 05:28:03,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28065 conditions, 23388 events. 1073/23388 cut-off events. For 495/497 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 255928 event pairs, 68 based on Foata normal form. 0/21903 useless extension candidates. Maximal degree in co-relation 27831. Up to 565 conditions per place. [2023-11-29 05:28:03,493 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 22 selfloop transitions, 2 changer transitions 0/687 dead transitions. [2023-11-29 05:28:03,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 687 transitions, 1796 flow [2023-11-29 05:28:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2023-11-29 05:28:03,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9633838383838383 [2023-11-29 05:28:03,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2289 transitions. [2023-11-29 05:28:03,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2289 transitions. [2023-11-29 05:28:03,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:03,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2289 transitions. [2023-11-29 05:28:03,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.0) internal successors, (2289), 3 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:03,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:03,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:03,498 INFO L175 Difference]: Start difference. First operand has 680 places, 687 transitions, 1747 flow. Second operand 3 states and 2289 transitions. [2023-11-29 05:28:03,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 687 transitions, 1796 flow [2023-11-29 05:28:03,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 687 transitions, 1790 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:03,512 INFO L231 Difference]: Finished difference. Result has 679 places, 686 transitions, 1743 flow [2023-11-29 05:28:03,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1743, PETRI_PLACES=679, PETRI_TRANSITIONS=686} [2023-11-29 05:28:03,513 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -53 predicate places. [2023-11-29 05:28:03,513 INFO L495 AbstractCegarLoop]: Abstraction has has 679 places, 686 transitions, 1743 flow [2023-11-29 05:28:03,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:03,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:03,513 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:03,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-11-29 05:28:03,513 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:28:03,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash 748926336, now seen corresponding path program 1 times [2023-11-29 05:28:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:03,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116832418] [2023-11-29 05:28:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:28:03,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:03,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116832418] [2023-11-29 05:28:03,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116832418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:03,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:03,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:28:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177986059] [2023-11-29 05:28:03,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:03,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:03,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:03,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:03,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:03,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 766 out of 792 [2023-11-29 05:28:03,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 686 transitions, 1743 flow. Second operand has 3 states, 3 states have (on average 767.6666666666666) internal successors, (2303), 3 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:03,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:03,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 766 of 792 [2023-11-29 05:28:03,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:06,983 INFO L124 PetriNetUnfolderBase]: 617/11886 cut-off events. [2023-11-29 05:28:06,984 INFO L125 PetriNetUnfolderBase]: For 277/281 co-relation queries the response was YES. [2023-11-29 05:28:07,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14537 conditions, 11886 events. 617/11886 cut-off events. For 277/281 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 115643 event pairs, 59 based on Foata normal form. 0/11094 useless extension candidates. Maximal degree in co-relation 14304. Up to 317 conditions per place. [2023-11-29 05:28:07,228 INFO L140 encePairwiseOnDemand]: 788/792 looper letters, 10 selfloop transitions, 3 changer transitions 0/689 dead transitions. [2023-11-29 05:28:07,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 689 transitions, 1776 flow [2023-11-29 05:28:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2312 transitions. [2023-11-29 05:28:07,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9730639730639731 [2023-11-29 05:28:07,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2312 transitions. [2023-11-29 05:28:07,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2312 transitions. [2023-11-29 05:28:07,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:07,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2312 transitions. [2023-11-29 05:28:07,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 770.6666666666666) internal successors, (2312), 3 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:07,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:07,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:07,234 INFO L175 Difference]: Start difference. First operand has 679 places, 686 transitions, 1743 flow. Second operand 3 states and 2312 transitions. [2023-11-29 05:28:07,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 689 transitions, 1776 flow [2023-11-29 05:28:07,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 689 transitions, 1772 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:07,244 INFO L231 Difference]: Finished difference. Result has 681 places, 688 transitions, 1761 flow [2023-11-29 05:28:07,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1761, PETRI_PLACES=681, PETRI_TRANSITIONS=688} [2023-11-29 05:28:07,245 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -51 predicate places. [2023-11-29 05:28:07,245 INFO L495 AbstractCegarLoop]: Abstraction has has 681 places, 688 transitions, 1761 flow [2023-11-29 05:28:07,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 767.6666666666666) internal successors, (2303), 3 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:07,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:07,246 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:07,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-11-29 05:28:07,246 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:28:07,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:07,247 INFO L85 PathProgramCache]: Analyzing trace with hash 852030052, now seen corresponding path program 1 times [2023-11-29 05:28:07,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:07,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427075719] [2023-11-29 05:28:07,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:07,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:28:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427075719] [2023-11-29 05:28:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427075719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:07,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095254633] [2023-11-29 05:28:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:07,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:07,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:07,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:07,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:07,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 792 [2023-11-29 05:28:07,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 688 transitions, 1761 flow. Second operand has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:07,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:07,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 792 [2023-11-29 05:28:07,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:10,733 INFO L124 PetriNetUnfolderBase]: 767/12712 cut-off events. [2023-11-29 05:28:10,733 INFO L125 PetriNetUnfolderBase]: For 818/822 co-relation queries the response was YES. [2023-11-29 05:28:10,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16285 conditions, 12712 events. 767/12712 cut-off events. For 818/822 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 130863 event pairs, 122 based on Foata normal form. 0/11981 useless extension candidates. Maximal degree in co-relation 16050. Up to 694 conditions per place. [2023-11-29 05:28:10,992 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 22 selfloop transitions, 2 changer transitions 0/688 dead transitions. [2023-11-29 05:28:10,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 688 transitions, 1810 flow [2023-11-29 05:28:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2023-11-29 05:28:10,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9633838383838383 [2023-11-29 05:28:10,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2289 transitions. [2023-11-29 05:28:10,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2289 transitions. [2023-11-29 05:28:10,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:10,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2289 transitions. [2023-11-29 05:28:10,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.0) internal successors, (2289), 3 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:10,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:10,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:10,997 INFO L175 Difference]: Start difference. First operand has 681 places, 688 transitions, 1761 flow. Second operand 3 states and 2289 transitions. [2023-11-29 05:28:10,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 688 transitions, 1810 flow [2023-11-29 05:28:11,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 688 transitions, 1804 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:11,009 INFO L231 Difference]: Finished difference. Result has 680 places, 687 transitions, 1757 flow [2023-11-29 05:28:11,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1757, PETRI_PLACES=680, PETRI_TRANSITIONS=687} [2023-11-29 05:28:11,009 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -52 predicate places. [2023-11-29 05:28:11,009 INFO L495 AbstractCegarLoop]: Abstraction has has 680 places, 687 transitions, 1757 flow [2023-11-29 05:28:11,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:11,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:11,010 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:11,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-11-29 05:28:11,010 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread1Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:28:11,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2034013883, now seen corresponding path program 1 times [2023-11-29 05:28:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:11,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279969454] [2023-11-29 05:28:11,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:28:11,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:11,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279969454] [2023-11-29 05:28:11,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279969454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:11,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:11,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:11,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224939697] [2023-11-29 05:28:11,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:11,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:11,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:11,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:11,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:11,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 792 [2023-11-29 05:28:11,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 687 transitions, 1757 flow. Second operand has 3 states, 3 states have (on average 765.0) internal successors, (2295), 3 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:11,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:11,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 792 [2023-11-29 05:28:11,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:14,382 INFO L124 PetriNetUnfolderBase]: 541/11516 cut-off events. [2023-11-29 05:28:14,382 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-11-29 05:28:14,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14168 conditions, 11516 events. 541/11516 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 107312 event pairs, 41 based on Foata normal form. 0/10892 useless extension candidates. Maximal degree in co-relation 13933. Up to 223 conditions per place. [2023-11-29 05:28:14,595 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 12 selfloop transitions, 2 changer transitions 0/687 dead transitions. [2023-11-29 05:28:14,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 687 transitions, 1786 flow [2023-11-29 05:28:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2023-11-29 05:28:14,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9684343434343434 [2023-11-29 05:28:14,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2023-11-29 05:28:14,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2023-11-29 05:28:14,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:14,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2023-11-29 05:28:14,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:14,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:14,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:14,600 INFO L175 Difference]: Start difference. First operand has 680 places, 687 transitions, 1757 flow. Second operand 3 states and 2301 transitions. [2023-11-29 05:28:14,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 687 transitions, 1786 flow [2023-11-29 05:28:14,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 687 transitions, 1782 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:14,611 INFO L231 Difference]: Finished difference. Result has 679 places, 686 transitions, 1755 flow [2023-11-29 05:28:14,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1755, PETRI_PLACES=679, PETRI_TRANSITIONS=686} [2023-11-29 05:28:14,612 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -53 predicate places. [2023-11-29 05:28:14,612 INFO L495 AbstractCegarLoop]: Abstraction has has 679 places, 686 transitions, 1755 flow [2023-11-29 05:28:14,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 765.0) internal successors, (2295), 3 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:14,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:14,613 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:14,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-11-29 05:28:14,613 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2023-11-29 05:28:14,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash 898314346, now seen corresponding path program 1 times [2023-11-29 05:28:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558677908] [2023-11-29 05:28:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:28:14,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:14,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558677908] [2023-11-29 05:28:14,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558677908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:14,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:14,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:28:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119914075] [2023-11-29 05:28:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:14,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:28:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:14,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:28:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:28:14,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 792 [2023-11-29 05:28:14,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 686 transitions, 1755 flow. Second operand has 3 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:14,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:14,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 792 [2023-11-29 05:28:14,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:18,139 INFO L124 PetriNetUnfolderBase]: 653/12582 cut-off events. [2023-11-29 05:28:18,139 INFO L125 PetriNetUnfolderBase]: For 263/267 co-relation queries the response was YES. [2023-11-29 05:28:18,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15500 conditions, 12582 events. 653/12582 cut-off events. For 263/267 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 123949 event pairs, 70 based on Foata normal form. 0/11878 useless extension candidates. Maximal degree in co-relation 15265. Up to 307 conditions per place. [2023-11-29 05:28:18,316 INFO L140 encePairwiseOnDemand]: 789/792 looper letters, 0 selfloop transitions, 0 changer transitions 686/686 dead transitions. [2023-11-29 05:28:18,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 686 transitions, 1784 flow [2023-11-29 05:28:18,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:28:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:28:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2023-11-29 05:28:18,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9684343434343434 [2023-11-29 05:28:18,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2023-11-29 05:28:18,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2023-11-29 05:28:18,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:18,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2023-11-29 05:28:18,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:18,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:18,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 792.0) internal successors, (3168), 4 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:18,321 INFO L175 Difference]: Start difference. First operand has 679 places, 686 transitions, 1755 flow. Second operand 3 states and 2301 transitions. [2023-11-29 05:28:18,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 686 transitions, 1784 flow [2023-11-29 05:28:18,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 686 transitions, 1780 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:28:18,330 INFO L231 Difference]: Finished difference. Result has 678 places, 0 transitions, 0 flow [2023-11-29 05:28:18,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=678, PETRI_TRANSITIONS=0} [2023-11-29 05:28:18,331 INFO L281 CegarLoopForPetriNet]: 732 programPoint places, -54 predicate places. [2023-11-29 05:28:18,331 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 0 transitions, 0 flow [2023-11-29 05:28:18,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:18,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (191 of 192 remaining) [2023-11-29 05:28:18,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (190 of 192 remaining) [2023-11-29 05:28:18,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (189 of 192 remaining) [2023-11-29 05:28:18,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (188 of 192 remaining) [2023-11-29 05:28:18,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (187 of 192 remaining) [2023-11-29 05:28:18,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (186 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (185 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (184 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (183 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (182 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (181 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (180 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (179 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (178 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (177 of 192 remaining) [2023-11-29 05:28:18,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (176 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (175 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (174 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (173 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (172 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (171 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (170 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (169 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (168 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (167 of 192 remaining) [2023-11-29 05:28:18,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (166 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (165 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (164 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (163 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (162 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (161 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (160 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (159 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (158 of 192 remaining) [2023-11-29 05:28:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (157 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (156 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (155 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (154 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (153 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (152 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (151 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (150 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (149 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (148 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (147 of 192 remaining) [2023-11-29 05:28:18,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (146 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (145 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (144 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (143 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (142 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (141 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (140 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (139 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (138 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (137 of 192 remaining) [2023-11-29 05:28:18,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (136 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (135 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (134 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (133 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (132 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (131 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (130 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (129 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (128 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (127 of 192 remaining) [2023-11-29 05:28:18,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (126 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (125 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (124 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (123 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (122 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (121 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (120 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (119 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (118 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (117 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (116 of 192 remaining) [2023-11-29 05:28:18,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (115 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (114 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (113 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (112 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (111 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (110 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (109 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (108 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (107 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (106 of 192 remaining) [2023-11-29 05:28:18,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (105 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (104 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (103 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (102 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (101 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (100 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (99 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (98 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (97 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (96 of 192 remaining) [2023-11-29 05:28:18,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (95 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (94 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (93 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (92 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (91 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (90 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (89 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (88 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (85 of 192 remaining) [2023-11-29 05:28:18,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (83 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (82 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (80 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (79 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (78 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (76 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (75 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (74 of 192 remaining) [2023-11-29 05:28:18,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (73 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (72 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (71 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (70 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (69 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (68 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (67 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (66 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (65 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 192 remaining) [2023-11-29 05:28:18,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (60 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (59 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (58 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (57 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (56 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (55 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (54 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (53 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (52 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (51 of 192 remaining) [2023-11-29 05:28:18,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (50 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (49 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (48 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (47 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (46 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (45 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (44 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (43 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 192 remaining) [2023-11-29 05:28:18,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (36 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (35 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (33 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (32 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (31 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (30 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (29 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (28 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (27 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (26 of 192 remaining) [2023-11-29 05:28:18,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (25 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (24 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (23 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (22 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (9 of 192 remaining) [2023-11-29 05:28:18,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (8 of 192 remaining) [2023-11-29 05:28:18,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 192 remaining) [2023-11-29 05:28:18,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 192 remaining) [2023-11-29 05:28:18,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 192 remaining) [2023-11-29 05:28:18,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (4 of 192 remaining) [2023-11-29 05:28:18,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (3 of 192 remaining) [2023-11-29 05:28:18,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 192 remaining) [2023-11-29 05:28:18,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 192 remaining) [2023-11-29 05:28:18,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 192 remaining) [2023-11-29 05:28:18,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-11-29 05:28:18,350 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:18,355 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:28:18,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:28:18,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:28:18 BasicIcfg [2023-11-29 05:28:18,360 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:28:18,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:28:18,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:28:18,361 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:28:18,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:25:56" (3/4) ... [2023-11-29 05:28:18,363 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:28:18,367 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-29 05:28:18,367 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-29 05:28:18,374 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-29 05:28:18,375 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 05:28:18,376 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:28:18,376 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:28:18,469 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:28:18,470 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:28:18,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:28:18,471 INFO L158 Benchmark]: Toolchain (without parser) took 143643.15ms. Allocated memory was 134.2MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 103.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-29 05:28:18,471 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:28:18,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.89ms. Allocated memory is still 134.2MB. Free memory was 102.4MB in the beginning and 88.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:28:18,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.28ms. Allocated memory is still 134.2MB. Free memory was 88.4MB in the beginning and 84.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:28:18,472 INFO L158 Benchmark]: Boogie Preprocessor took 62.40ms. Allocated memory is still 134.2MB. Free memory was 84.8MB in the beginning and 82.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:28:18,473 INFO L158 Benchmark]: RCFGBuilder took 1090.75ms. Allocated memory is still 134.2MB. Free memory was 81.6MB in the beginning and 92.9MB in the end (delta: -11.4MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2023-11-29 05:28:18,473 INFO L158 Benchmark]: TraceAbstraction took 141968.57ms. Allocated memory was 134.2MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 92.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2023-11-29 05:28:18,474 INFO L158 Benchmark]: Witness Printer took 109.27ms. Allocated memory is still 2.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 05:28:18,476 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.89ms. Allocated memory is still 134.2MB. Free memory was 102.4MB in the beginning and 88.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.28ms. Allocated memory is still 134.2MB. Free memory was 88.4MB in the beginning and 84.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.40ms. Allocated memory is still 134.2MB. Free memory was 84.8MB in the beginning and 82.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1090.75ms. Allocated memory is still 134.2MB. Free memory was 81.6MB in the beginning and 92.9MB in the end (delta: -11.4MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 141968.57ms. Allocated memory was 134.2MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 92.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 109.27ms. Allocated memory is still 2.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1274 locations, 192 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 141.7s, OverallIterations: 59, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 133.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3686 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1389 mSDsluCounter, 873 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 478 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4317 IncrementalHoareTripleChecker+Invalid, 4795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 478 mSolverCounterUnsat, 653 mSDtfsCounter, 4317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1761occurred in iteration=56, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 12285 NumberOfCodeBlocks, 12285 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 12391 ConstructedInterpolants, 0 QuantifiedInterpolants, 13654 SizeOfPredicates, 5 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 61 InterpolantComputations, 58 PerfectInterpolantSequences, 1968/1971 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 104 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 05:28:18,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17ef227d-b8f2-4e96-ab84-cf57fcca93fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE