./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-subst.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_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/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_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/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_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/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 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:42:37,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:42:37,412 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 01:42:37,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:42:37,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:42:37,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:42:37,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:42:37,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:42:37,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:42:37,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:42:37,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:42:37,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:42:37,445 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:42:37,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:42:37,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:42:37,447 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:42:37,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:42:37,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:42:37,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:42:37,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:42:37,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:42:37,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:42:37,450 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 01:42:37,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:42:37,451 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:42:37,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:42:37,452 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:42:37,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:42:37,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:42:37,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:42:37,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:42:37,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:42:37,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:42:37,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:42:37,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:42:37,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:42:37,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:42:37,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:42:37,455 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:42:37,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:42:37,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:42:37,456 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_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/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_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2023-11-29 01:42:37,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:42:37,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:42:37,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:42:37,703 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:42:37,706 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:42:37,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2023-11-29 01:42:40,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:42:40,671 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:42:40,672 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2023-11-29 01:42:40,682 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/data/a4ddf66f6/9dd46be326814653abad890fa65cfa22/FLAGfc444b0e1 [2023-11-29 01:42:40,699 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/data/a4ddf66f6/9dd46be326814653abad890fa65cfa22 [2023-11-29 01:42:40,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:42:40,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:42:40,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:42:40,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:42:40,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:42:40,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:42:40" (1/1) ... [2023-11-29 01:42:40,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6880ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:40, skipping insertion in model container [2023-11-29 01:42:40,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:42:40" (1/1) ... [2023-11-29 01:42:40,749 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:42:41,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:42:41,019 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:42:41,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:42:41,095 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:42:41,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41 WrapperNode [2023-11-29 01:42:41,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:42:41,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:42:41,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:42:41,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:42:41,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,177 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 878 [2023-11-29 01:42:41,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:42:41,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:42:41,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:42:41,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:42:41,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:42:41,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:42:41,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:42:41,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:42:41,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (1/1) ... [2023-11-29 01:42:41,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:42:41,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:42:41,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:42:41,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:42:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:42:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:42:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 01:42:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 01:42:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 01:42:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 01:42:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 01:42:41,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 01:42:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 01:42:41,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 01:42:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 01:42:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:42:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:42:41,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:42:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:42:41,324 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 01:42:41,481 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:42:41,484 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:42:42,443 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:42:42,470 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:42:42,470 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:42:42,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:42:42 BoogieIcfgContainer [2023-11-29 01:42:42,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:42:42,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:42:42,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:42:42,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:42:42,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:42:40" (1/3) ... [2023-11-29 01:42:42,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734175eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:42:42, skipping insertion in model container [2023-11-29 01:42:42,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:41" (2/3) ... [2023-11-29 01:42:42,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734175eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:42:42, skipping insertion in model container [2023-11-29 01:42:42,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:42:42" (3/3) ... [2023-11-29 01:42:42,481 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2023-11-29 01:42:42,488 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 01:42:42,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:42:42,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 154 error locations. [2023-11-29 01:42:42,496 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:42:42,688 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 01:42:42,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1091 places, 1139 transitions, 2299 flow [2023-11-29 01:42:43,528 INFO L124 PetriNetUnfolderBase]: 58/1136 cut-off events. [2023-11-29 01:42:43,528 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:42:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1136 events. 58/1136 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3936 event pairs, 0 based on Foata normal form. 0/924 useless extension candidates. Maximal degree in co-relation 857. Up to 2 conditions per place. [2023-11-29 01:42:43,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 1091 places, 1139 transitions, 2299 flow [2023-11-29 01:42:43,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1062 places, 1107 transitions, 2232 flow [2023-11-29 01:42:43,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:42:43,658 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;@5bde4485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:42:43,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 286 error locations. [2023-11-29 01:42:43,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:42:43,665 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2023-11-29 01:42:43,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:42:43,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:42:43,666 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] [2023-11-29 01:42:43,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:42:43,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash 505156041, now seen corresponding path program 1 times [2023-11-29 01:42:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848113609] [2023-11-29 01:42:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:43,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:42:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:43,906 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 01:42:43,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:42:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848113609] [2023-11-29 01:42:43,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848113609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:42:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213741071] [2023-11-29 01:42:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:43,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:42:43,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:42:43,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:42:43,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:42:44,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:42:44,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1062 places, 1107 transitions, 2232 flow. Second operand has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:44,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:42:44,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:42:44,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:42:48,241 INFO L124 PetriNetUnfolderBase]: 612/12448 cut-off events. [2023-11-29 01:42:48,242 INFO L125 PetriNetUnfolderBase]: For 72/84 co-relation queries the response was YES. [2023-11-29 01:42:48,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12733 conditions, 12448 events. 612/12448 cut-off events. For 72/84 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 126787 event pairs, 95 based on Foata normal form. 294/10095 useless extension candidates. Maximal degree in co-relation 12395. Up to 185 conditions per place. [2023-11-29 01:42:48,458 INFO L140 encePairwiseOnDemand]: 1118/1139 looper letters, 19 selfloop transitions, 2 changer transitions 2/1088 dead transitions. [2023-11-29 01:42:48,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1063 places, 1088 transitions, 2236 flow [2023-11-29 01:42:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:42:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:42:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3328 transitions. [2023-11-29 01:42:48,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9739537606087211 [2023-11-29 01:42:48,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3328 transitions. [2023-11-29 01:42:48,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3328 transitions. [2023-11-29 01:42:48,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:42:48,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3328 transitions. [2023-11-29 01:42:48,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1109.3333333333333) internal successors, (3328), 3 states have internal predecessors, (3328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:48,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:48,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:48,522 INFO L175 Difference]: Start difference. First operand has 1062 places, 1107 transitions, 2232 flow. Second operand 3 states and 3328 transitions. [2023-11-29 01:42:48,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1063 places, 1088 transitions, 2236 flow [2023-11-29 01:42:48,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1057 places, 1088 transitions, 2224 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 01:42:48,553 INFO L231 Difference]: Finished difference. Result has 1057 places, 1086 transitions, 2182 flow [2023-11-29 01:42:48,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=1055, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1088, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1086, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2182, PETRI_PLACES=1057, PETRI_TRANSITIONS=1086} [2023-11-29 01:42:48,559 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -5 predicate places. [2023-11-29 01:42:48,559 INFO L495 AbstractCegarLoop]: Abstraction has has 1057 places, 1086 transitions, 2182 flow [2023-11-29 01:42:48,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:48,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:42:48,562 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] [2023-11-29 01:42:48,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:42:48,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:42:48,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1802626749, now seen corresponding path program 1 times [2023-11-29 01:42:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849971882] [2023-11-29 01:42:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:42:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:48,632 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 01:42:48,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:42:48,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849971882] [2023-11-29 01:42:48,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849971882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:48,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:48,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:42:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889623076] [2023-11-29 01:42:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:48,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:42:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:42:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:42:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:42:48,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:42:48,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1057 places, 1086 transitions, 2182 flow. Second operand has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:48,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:42:48,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:42:48,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:42:50,521 INFO L124 PetriNetUnfolderBase]: 226/4436 cut-off events. [2023-11-29 01:42:50,521 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2023-11-29 01:42:50,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 4436 events. 226/4436 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 33405 event pairs, 45 based on Foata normal form. 0/3508 useless extension candidates. Maximal degree in co-relation 4524. Up to 110 conditions per place. [2023-11-29 01:42:50,617 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 19 selfloop transitions, 2 changer transitions 0/1085 dead transitions. [2023-11-29 01:42:50,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1056 places, 1085 transitions, 2222 flow [2023-11-29 01:42:50,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:42:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:42:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3310 transitions. [2023-11-29 01:42:50,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9686859818554288 [2023-11-29 01:42:50,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3310 transitions. [2023-11-29 01:42:50,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3310 transitions. [2023-11-29 01:42:50,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:42:50,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3310 transitions. [2023-11-29 01:42:50,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1103.3333333333333) internal successors, (3310), 3 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:50,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:50,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:50,647 INFO L175 Difference]: Start difference. First operand has 1057 places, 1086 transitions, 2182 flow. Second operand 3 states and 3310 transitions. [2023-11-29 01:42:50,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1056 places, 1085 transitions, 2222 flow [2023-11-29 01:42:50,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1054 places, 1085 transitions, 2218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:42:50,664 INFO L231 Difference]: Finished difference. Result has 1054 places, 1085 transitions, 2180 flow [2023-11-29 01:42:50,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=1052, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1083, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2180, PETRI_PLACES=1054, PETRI_TRANSITIONS=1085} [2023-11-29 01:42:50,666 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -8 predicate places. [2023-11-29 01:42:50,667 INFO L495 AbstractCegarLoop]: Abstraction has has 1054 places, 1085 transitions, 2180 flow [2023-11-29 01:42:50,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:50,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:42:50,670 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] [2023-11-29 01:42:50,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:42:50,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:42:50,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash -544571182, now seen corresponding path program 1 times [2023-11-29 01:42:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765439800] [2023-11-29 01:42:50,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:42:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:50,734 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 01:42:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:42:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765439800] [2023-11-29 01:42:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765439800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:42:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196594964] [2023-11-29 01:42:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:42:50,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:42:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:42:50,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:42:50,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:42:50,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1054 places, 1085 transitions, 2180 flow. Second operand has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:50,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:42:50,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:42:50,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:42:52,019 INFO L124 PetriNetUnfolderBase]: 240/3784 cut-off events. [2023-11-29 01:42:52,019 INFO L125 PetriNetUnfolderBase]: For 43/74 co-relation queries the response was YES. [2023-11-29 01:42:52,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3983 conditions, 3784 events. 240/3784 cut-off events. For 43/74 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 28620 event pairs, 95 based on Foata normal form. 0/3018 useless extension candidates. Maximal degree in co-relation 3934. Up to 185 conditions per place. [2023-11-29 01:42:52,130 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 19 selfloop transitions, 2 changer transitions 0/1084 dead transitions. [2023-11-29 01:42:52,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1055 places, 1084 transitions, 2220 flow [2023-11-29 01:42:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:42:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:42:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3310 transitions. [2023-11-29 01:42:52,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9686859818554288 [2023-11-29 01:42:52,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3310 transitions. [2023-11-29 01:42:52,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3310 transitions. [2023-11-29 01:42:52,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:42:52,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3310 transitions. [2023-11-29 01:42:52,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1103.3333333333333) internal successors, (3310), 3 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:52,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:52,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:52,159 INFO L175 Difference]: Start difference. First operand has 1054 places, 1085 transitions, 2180 flow. Second operand 3 states and 3310 transitions. [2023-11-29 01:42:52,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1055 places, 1084 transitions, 2220 flow [2023-11-29 01:42:52,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1053 places, 1084 transitions, 2216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:42:52,173 INFO L231 Difference]: Finished difference. Result has 1053 places, 1084 transitions, 2178 flow [2023-11-29 01:42:52,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=1051, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1082, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2178, PETRI_PLACES=1053, PETRI_TRANSITIONS=1084} [2023-11-29 01:42:52,176 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -9 predicate places. [2023-11-29 01:42:52,176 INFO L495 AbstractCegarLoop]: Abstraction has has 1053 places, 1084 transitions, 2178 flow [2023-11-29 01:42:52,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:52,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:42:52,179 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] [2023-11-29 01:42:52,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:42:52,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:42:52,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1406718236, now seen corresponding path program 1 times [2023-11-29 01:42:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133110204] [2023-11-29 01:42:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:42:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:52,237 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 01:42:52,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:42:52,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133110204] [2023-11-29 01:42:52,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133110204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:52,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:52,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:42:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820669051] [2023-11-29 01:42:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:52,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:42:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:42:52,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:42:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:42:52,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1097 out of 1139 [2023-11-29 01:42:52,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1053 places, 1084 transitions, 2178 flow. Second operand has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:52,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:42:52,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1097 of 1139 [2023-11-29 01:42:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:42:54,173 INFO L124 PetriNetUnfolderBase]: 245/5563 cut-off events. [2023-11-29 01:42:54,173 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 01:42:54,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5639 conditions, 5563 events. 245/5563 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 44358 event pairs, 16 based on Foata normal form. 0/4399 useless extension candidates. Maximal degree in co-relation 5582. Up to 51 conditions per place. [2023-11-29 01:42:54,314 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 18 selfloop transitions, 2 changer transitions 0/1083 dead transitions. [2023-11-29 01:42:54,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1054 places, 1083 transitions, 2216 flow [2023-11-29 01:42:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:42:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:42:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3312 transitions. [2023-11-29 01:42:54,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9692712906057945 [2023-11-29 01:42:54,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3312 transitions. [2023-11-29 01:42:54,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3312 transitions. [2023-11-29 01:42:54,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:42:54,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3312 transitions. [2023-11-29 01:42:54,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.0) internal successors, (3312), 3 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:54,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:54,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:54,359 INFO L175 Difference]: Start difference. First operand has 1053 places, 1084 transitions, 2178 flow. Second operand 3 states and 3312 transitions. [2023-11-29 01:42:54,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1054 places, 1083 transitions, 2216 flow [2023-11-29 01:42:54,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1052 places, 1083 transitions, 2212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:42:54,382 INFO L231 Difference]: Finished difference. Result has 1052 places, 1083 transitions, 2176 flow [2023-11-29 01:42:54,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2172, PETRI_DIFFERENCE_MINUEND_PLACES=1050, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1083, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1081, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2176, PETRI_PLACES=1052, PETRI_TRANSITIONS=1083} [2023-11-29 01:42:54,384 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -10 predicate places. [2023-11-29 01:42:54,385 INFO L495 AbstractCegarLoop]: Abstraction has has 1052 places, 1083 transitions, 2176 flow [2023-11-29 01:42:54,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:54,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:42:54,388 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] [2023-11-29 01:42:54,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:42:54,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:42:54,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash -871244408, now seen corresponding path program 1 times [2023-11-29 01:42:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:54,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610603608] [2023-11-29 01:42:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:54,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:42:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:54,450 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 01:42:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:42:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610603608] [2023-11-29 01:42:54,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610603608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:54,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:54,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:42:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264202850] [2023-11-29 01:42:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:54,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:42:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:42:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:42:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:42:54,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1100 out of 1139 [2023-11-29 01:42:54,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 1083 transitions, 2176 flow. Second operand has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:54,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:42:54,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1100 of 1139 [2023-11-29 01:42:54,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:42:55,143 INFO L124 PetriNetUnfolderBase]: 73/1630 cut-off events. [2023-11-29 01:42:55,144 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:42:55,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 1630 events. 73/1630 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8296 event pairs, 12 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 1626. Up to 40 conditions per place. [2023-11-29 01:42:55,198 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 15 selfloop transitions, 2 changer transitions 0/1082 dead transitions. [2023-11-29 01:42:55,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1053 places, 1082 transitions, 2208 flow [2023-11-29 01:42:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:42:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:42:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3318 transitions. [2023-11-29 01:42:55,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.971027216856892 [2023-11-29 01:42:55,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3318 transitions. [2023-11-29 01:42:55,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3318 transitions. [2023-11-29 01:42:55,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:42:55,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3318 transitions. [2023-11-29 01:42:55,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1106.0) internal successors, (3318), 3 states have internal predecessors, (3318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:55,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:55,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:55,234 INFO L175 Difference]: Start difference. First operand has 1052 places, 1083 transitions, 2176 flow. Second operand 3 states and 3318 transitions. [2023-11-29 01:42:55,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1053 places, 1082 transitions, 2208 flow [2023-11-29 01:42:55,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1051 places, 1082 transitions, 2204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:42:55,262 INFO L231 Difference]: Finished difference. Result has 1051 places, 1082 transitions, 2174 flow [2023-11-29 01:42:55,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=1049, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1082, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1080, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2174, PETRI_PLACES=1051, PETRI_TRANSITIONS=1082} [2023-11-29 01:42:55,265 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -11 predicate places. [2023-11-29 01:42:55,265 INFO L495 AbstractCegarLoop]: Abstraction has has 1051 places, 1082 transitions, 2174 flow [2023-11-29 01:42:55,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:55,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:42:55,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:42:55,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:42:55,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1351202698, now seen corresponding path program 1 times [2023-11-29 01:42:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:55,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329418954] [2023-11-29 01:42:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:42:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:55,331 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 01:42:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:42:55,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329418954] [2023-11-29 01:42:55,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329418954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:55,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:55,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:42:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405404819] [2023-11-29 01:42:55,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:55,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:42:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:42:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:42:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:42:55,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1101 out of 1139 [2023-11-29 01:42:55,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1051 places, 1082 transitions, 2174 flow. Second operand has 3 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:55,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:42:55,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1101 of 1139 [2023-11-29 01:42:55,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:42:56,691 INFO L124 PetriNetUnfolderBase]: 167/3881 cut-off events. [2023-11-29 01:42:56,691 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 01:42:56,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 3881 events. 167/3881 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 26483 event pairs, 10 based on Foata normal form. 0/3083 useless extension candidates. Maximal degree in co-relation 3862. Up to 35 conditions per place. [2023-11-29 01:42:56,803 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 14 selfloop transitions, 2 changer transitions 0/1081 dead transitions. [2023-11-29 01:42:56,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1052 places, 1081 transitions, 2204 flow [2023-11-29 01:42:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:42:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:42:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3320 transitions. [2023-11-29 01:42:56,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9716125256072579 [2023-11-29 01:42:56,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3320 transitions. [2023-11-29 01:42:56,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3320 transitions. [2023-11-29 01:42:56,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:42:56,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3320 transitions. [2023-11-29 01:42:56,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1106.6666666666667) internal successors, (3320), 3 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:56,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:56,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:56,823 INFO L175 Difference]: Start difference. First operand has 1051 places, 1082 transitions, 2174 flow. Second operand 3 states and 3320 transitions. [2023-11-29 01:42:56,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1052 places, 1081 transitions, 2204 flow [2023-11-29 01:42:56,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1050 places, 1081 transitions, 2200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:42:56,838 INFO L231 Difference]: Finished difference. Result has 1050 places, 1081 transitions, 2172 flow [2023-11-29 01:42:56,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2168, PETRI_DIFFERENCE_MINUEND_PLACES=1048, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1081, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1079, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2172, PETRI_PLACES=1050, PETRI_TRANSITIONS=1081} [2023-11-29 01:42:56,841 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -12 predicate places. [2023-11-29 01:42:56,841 INFO L495 AbstractCegarLoop]: Abstraction has has 1050 places, 1081 transitions, 2172 flow [2023-11-29 01:42:56,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:56,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:42:56,842 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] [2023-11-29 01:42:56,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:42:56,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:42:56,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash 452865631, now seen corresponding path program 1 times [2023-11-29 01:42:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:56,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013477168] [2023-11-29 01:42:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:56,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:42:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:56,891 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 01:42:56,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:42:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013477168] [2023-11-29 01:42:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013477168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:56,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:42:56,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019491889] [2023-11-29 01:42:56,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:56,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:42:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:42:56,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:42:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:42:56,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1094 out of 1139 [2023-11-29 01:42:56,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1050 places, 1081 transitions, 2172 flow. Second operand has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:56,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:42:56,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1094 of 1139 [2023-11-29 01:42:56,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:42:59,757 INFO L124 PetriNetUnfolderBase]: 349/7800 cut-off events. [2023-11-29 01:42:59,758 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 01:42:59,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7903 conditions, 7800 events. 349/7800 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 69387 event pairs, 24 based on Foata normal form. 0/6161 useless extension candidates. Maximal degree in co-relation 7822. Up to 70 conditions per place. [2023-11-29 01:42:59,942 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 21 selfloop transitions, 2 changer transitions 0/1080 dead transitions. [2023-11-29 01:42:59,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1051 places, 1080 transitions, 2216 flow [2023-11-29 01:42:59,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:42:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:42:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3306 transitions. [2023-11-29 01:42:59,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9675153643546971 [2023-11-29 01:42:59,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3306 transitions. [2023-11-29 01:42:59,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3306 transitions. [2023-11-29 01:42:59,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:42:59,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3306 transitions. [2023-11-29 01:42:59,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1102.0) internal successors, (3306), 3 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:59,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:59,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:59,967 INFO L175 Difference]: Start difference. First operand has 1050 places, 1081 transitions, 2172 flow. Second operand 3 states and 3306 transitions. [2023-11-29 01:42:59,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1051 places, 1080 transitions, 2216 flow [2023-11-29 01:42:59,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1049 places, 1080 transitions, 2212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:42:59,990 INFO L231 Difference]: Finished difference. Result has 1049 places, 1080 transitions, 2170 flow [2023-11-29 01:42:59,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=1047, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1080, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1078, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2170, PETRI_PLACES=1049, PETRI_TRANSITIONS=1080} [2023-11-29 01:42:59,993 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -13 predicate places. [2023-11-29 01:42:59,993 INFO L495 AbstractCegarLoop]: Abstraction has has 1049 places, 1080 transitions, 2170 flow [2023-11-29 01:42:59,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:59,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:42:59,995 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] [2023-11-29 01:42:59,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:42:59,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:42:59,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1271957725, now seen corresponding path program 1 times [2023-11-29 01:42:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068935763] [2023-11-29 01:42:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:00,043 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 01:43:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068935763] [2023-11-29 01:43:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068935763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:00,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410131303] [2023-11-29 01:43:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:00,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:00,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:00,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:43:00,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1049 places, 1080 transitions, 2170 flow. Second operand has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:00,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:00,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:43:00,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:01,406 INFO L124 PetriNetUnfolderBase]: 149/3415 cut-off events. [2023-11-29 01:43:01,406 INFO L125 PetriNetUnfolderBase]: For 11/32 co-relation queries the response was YES. [2023-11-29 01:43:01,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3484 conditions, 3415 events. 149/3415 cut-off events. For 11/32 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 22940 event pairs, 16 based on Foata normal form. 0/2724 useless extension candidates. Maximal degree in co-relation 3395. Up to 52 conditions per place. [2023-11-29 01:43:01,560 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 19 selfloop transitions, 2 changer transitions 0/1079 dead transitions. [2023-11-29 01:43:01,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1050 places, 1079 transitions, 2210 flow [2023-11-29 01:43:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3310 transitions. [2023-11-29 01:43:01,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9686859818554288 [2023-11-29 01:43:01,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3310 transitions. [2023-11-29 01:43:01,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3310 transitions. [2023-11-29 01:43:01,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:01,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3310 transitions. [2023-11-29 01:43:01,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1103.3333333333333) internal successors, (3310), 3 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:01,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:01,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:01,584 INFO L175 Difference]: Start difference. First operand has 1049 places, 1080 transitions, 2170 flow. Second operand 3 states and 3310 transitions. [2023-11-29 01:43:01,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1050 places, 1079 transitions, 2210 flow [2023-11-29 01:43:01,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 1079 transitions, 2206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:01,601 INFO L231 Difference]: Finished difference. Result has 1048 places, 1079 transitions, 2168 flow [2023-11-29 01:43:01,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2164, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1079, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1077, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2168, PETRI_PLACES=1048, PETRI_TRANSITIONS=1079} [2023-11-29 01:43:01,603 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -14 predicate places. [2023-11-29 01:43:01,603 INFO L495 AbstractCegarLoop]: Abstraction has has 1048 places, 1079 transitions, 2168 flow [2023-11-29 01:43:01,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:01,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:01,605 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] [2023-11-29 01:43:01,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:43:01,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:01,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1812713042, now seen corresponding path program 1 times [2023-11-29 01:43:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:01,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133219698] [2023-11-29 01:43:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:01,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:01,653 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 01:43:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133219698] [2023-11-29 01:43:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133219698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:01,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:01,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675249711] [2023-11-29 01:43:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:01,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:01,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:01,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1100 out of 1139 [2023-11-29 01:43:01,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 1079 transitions, 2168 flow. Second operand has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:01,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:01,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1100 of 1139 [2023-11-29 01:43:01,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:02,237 INFO L124 PetriNetUnfolderBase]: 73/1626 cut-off events. [2023-11-29 01:43:02,237 INFO L125 PetriNetUnfolderBase]: For 9/15 co-relation queries the response was YES. [2023-11-29 01:43:02,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1626 events. 73/1626 cut-off events. For 9/15 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7923 event pairs, 12 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 1584. Up to 40 conditions per place. [2023-11-29 01:43:02,293 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 15 selfloop transitions, 2 changer transitions 0/1078 dead transitions. [2023-11-29 01:43:02,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 1078 transitions, 2200 flow [2023-11-29 01:43:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3318 transitions. [2023-11-29 01:43:02,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.971027216856892 [2023-11-29 01:43:02,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3318 transitions. [2023-11-29 01:43:02,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3318 transitions. [2023-11-29 01:43:02,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:02,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3318 transitions. [2023-11-29 01:43:02,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1106.0) internal successors, (3318), 3 states have internal predecessors, (3318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:02,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:02,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:02,312 INFO L175 Difference]: Start difference. First operand has 1048 places, 1079 transitions, 2168 flow. Second operand 3 states and 3318 transitions. [2023-11-29 01:43:02,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 1078 transitions, 2200 flow [2023-11-29 01:43:02,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1047 places, 1078 transitions, 2196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:02,328 INFO L231 Difference]: Finished difference. Result has 1047 places, 1078 transitions, 2166 flow [2023-11-29 01:43:02,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=1045, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1076, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2166, PETRI_PLACES=1047, PETRI_TRANSITIONS=1078} [2023-11-29 01:43:02,330 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -15 predicate places. [2023-11-29 01:43:02,330 INFO L495 AbstractCegarLoop]: Abstraction has has 1047 places, 1078 transitions, 2166 flow [2023-11-29 01:43:02,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:02,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:02,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:02,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:43:02,332 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:02,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1964301411, now seen corresponding path program 1 times [2023-11-29 01:43:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:02,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504324397] [2023-11-29 01:43:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:02,374 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 01:43:02,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:02,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504324397] [2023-11-29 01:43:02,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504324397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:02,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:02,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:02,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620009669] [2023-11-29 01:43:02,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:02,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:02,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:02,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:02,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1101 out of 1139 [2023-11-29 01:43:02,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 1078 transitions, 2166 flow. Second operand has 3 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:02,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:02,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1101 of 1139 [2023-11-29 01:43:02,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:03,358 INFO L124 PetriNetUnfolderBase]: 107/2537 cut-off events. [2023-11-29 01:43:03,358 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-29 01:43:03,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 2537 events. 107/2537 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 14517 event pairs, 10 based on Foata normal form. 0/2036 useless extension candidates. Maximal degree in co-relation 2481. Up to 35 conditions per place. [2023-11-29 01:43:03,459 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 14 selfloop transitions, 2 changer transitions 0/1077 dead transitions. [2023-11-29 01:43:03,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1048 places, 1077 transitions, 2196 flow [2023-11-29 01:43:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3320 transitions. [2023-11-29 01:43:03,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9716125256072579 [2023-11-29 01:43:03,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3320 transitions. [2023-11-29 01:43:03,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3320 transitions. [2023-11-29 01:43:03,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:03,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3320 transitions. [2023-11-29 01:43:03,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1106.6666666666667) internal successors, (3320), 3 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:03,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:03,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:03,478 INFO L175 Difference]: Start difference. First operand has 1047 places, 1078 transitions, 2166 flow. Second operand 3 states and 3320 transitions. [2023-11-29 01:43:03,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1048 places, 1077 transitions, 2196 flow [2023-11-29 01:43:03,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 1077 transitions, 2192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:03,493 INFO L231 Difference]: Finished difference. Result has 1046 places, 1077 transitions, 2164 flow [2023-11-29 01:43:03,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=1044, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1077, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1075, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2164, PETRI_PLACES=1046, PETRI_TRANSITIONS=1077} [2023-11-29 01:43:03,495 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -16 predicate places. [2023-11-29 01:43:03,496 INFO L495 AbstractCegarLoop]: Abstraction has has 1046 places, 1077 transitions, 2164 flow [2023-11-29 01:43:03,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:03,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:03,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:03,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:43:03,497 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:03,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2024058722, now seen corresponding path program 1 times [2023-11-29 01:43:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:03,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101581672] [2023-11-29 01:43:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:03,533 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 01:43:03,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101581672] [2023-11-29 01:43:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101581672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:03,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:03,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186369499] [2023-11-29 01:43:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:03,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:03,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1094 out of 1139 [2023-11-29 01:43:03,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 1077 transitions, 2164 flow. Second operand has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:03,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:03,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1094 of 1139 [2023-11-29 01:43:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:05,406 INFO L124 PetriNetUnfolderBase]: 205/4580 cut-off events. [2023-11-29 01:43:05,406 INFO L125 PetriNetUnfolderBase]: For 15/99 co-relation queries the response was YES. [2023-11-29 01:43:05,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4671 conditions, 4580 events. 205/4580 cut-off events. For 15/99 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 34614 event pairs, 24 based on Foata normal form. 0/3642 useless extension candidates. Maximal degree in co-relation 4558. Up to 70 conditions per place. [2023-11-29 01:43:05,635 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 21 selfloop transitions, 2 changer transitions 0/1076 dead transitions. [2023-11-29 01:43:05,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 1076 transitions, 2208 flow [2023-11-29 01:43:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3306 transitions. [2023-11-29 01:43:05,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9675153643546971 [2023-11-29 01:43:05,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3306 transitions. [2023-11-29 01:43:05,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3306 transitions. [2023-11-29 01:43:05,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:05,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3306 transitions. [2023-11-29 01:43:05,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1102.0) internal successors, (3306), 3 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:05,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:05,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:05,649 INFO L175 Difference]: Start difference. First operand has 1046 places, 1077 transitions, 2164 flow. Second operand 3 states and 3306 transitions. [2023-11-29 01:43:05,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1047 places, 1076 transitions, 2208 flow [2023-11-29 01:43:05,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 1076 transitions, 2204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:05,662 INFO L231 Difference]: Finished difference. Result has 1045 places, 1076 transitions, 2162 flow [2023-11-29 01:43:05,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1074, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2162, PETRI_PLACES=1045, PETRI_TRANSITIONS=1076} [2023-11-29 01:43:05,664 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -17 predicate places. [2023-11-29 01:43:05,664 INFO L495 AbstractCegarLoop]: Abstraction has has 1045 places, 1076 transitions, 2162 flow [2023-11-29 01:43:05,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:05,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:05,665 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] [2023-11-29 01:43:05,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:43:05,665 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:05,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1545794200, now seen corresponding path program 1 times [2023-11-29 01:43:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:05,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84322960] [2023-11-29 01:43:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:05,707 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 01:43:05,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:05,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84322960] [2023-11-29 01:43:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84322960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:05,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:05,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282973875] [2023-11-29 01:43:05,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:05,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:05,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:05,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:05,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:43:05,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1045 places, 1076 transitions, 2162 flow. Second operand has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:05,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:05,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:43:05,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:06,227 INFO L124 PetriNetUnfolderBase]: 77/1591 cut-off events. [2023-11-29 01:43:06,227 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2023-11-29 01:43:06,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 1591 events. 77/1591 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7531 event pairs, 16 based on Foata normal form. 0/1291 useless extension candidates. Maximal degree in co-relation 1533. Up to 54 conditions per place. [2023-11-29 01:43:06,271 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 19 selfloop transitions, 2 changer transitions 0/1075 dead transitions. [2023-11-29 01:43:06,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 1075 transitions, 2202 flow [2023-11-29 01:43:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3310 transitions. [2023-11-29 01:43:06,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9686859818554288 [2023-11-29 01:43:06,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3310 transitions. [2023-11-29 01:43:06,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3310 transitions. [2023-11-29 01:43:06,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:06,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3310 transitions. [2023-11-29 01:43:06,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1103.3333333333333) internal successors, (3310), 3 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:06,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:06,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:06,290 INFO L175 Difference]: Start difference. First operand has 1045 places, 1076 transitions, 2162 flow. Second operand 3 states and 3310 transitions. [2023-11-29 01:43:06,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 1075 transitions, 2202 flow [2023-11-29 01:43:06,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 1075 transitions, 2198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:06,309 INFO L231 Difference]: Finished difference. Result has 1044 places, 1075 transitions, 2160 flow [2023-11-29 01:43:06,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=1042, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2160, PETRI_PLACES=1044, PETRI_TRANSITIONS=1075} [2023-11-29 01:43:06,312 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -18 predicate places. [2023-11-29 01:43:06,312 INFO L495 AbstractCegarLoop]: Abstraction has has 1044 places, 1075 transitions, 2160 flow [2023-11-29 01:43:06,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:06,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:06,313 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] [2023-11-29 01:43:06,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:43:06,314 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:06,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:06,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1252224430, now seen corresponding path program 1 times [2023-11-29 01:43:06,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:06,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098989406] [2023-11-29 01:43:06,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:06,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:06,361 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 01:43:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098989406] [2023-11-29 01:43:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098989406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:06,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:06,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885630646] [2023-11-29 01:43:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:06,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:06,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:06,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:06,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1100 out of 1139 [2023-11-29 01:43:06,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 1075 transitions, 2160 flow. Second operand has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:06,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:06,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1100 of 1139 [2023-11-29 01:43:06,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:07,094 INFO L124 PetriNetUnfolderBase]: 73/1622 cut-off events. [2023-11-29 01:43:07,094 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2023-11-29 01:43:07,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 1622 events. 73/1622 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 7429 event pairs, 12 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 1542. Up to 40 conditions per place. [2023-11-29 01:43:07,148 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 15 selfloop transitions, 2 changer transitions 0/1074 dead transitions. [2023-11-29 01:43:07,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 1074 transitions, 2192 flow [2023-11-29 01:43:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3318 transitions. [2023-11-29 01:43:07,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.971027216856892 [2023-11-29 01:43:07,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3318 transitions. [2023-11-29 01:43:07,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3318 transitions. [2023-11-29 01:43:07,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:07,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3318 transitions. [2023-11-29 01:43:07,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1106.0) internal successors, (3318), 3 states have internal predecessors, (3318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:07,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:07,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:07,168 INFO L175 Difference]: Start difference. First operand has 1044 places, 1075 transitions, 2160 flow. Second operand 3 states and 3318 transitions. [2023-11-29 01:43:07,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 1074 transitions, 2192 flow [2023-11-29 01:43:07,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1043 places, 1074 transitions, 2188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:07,186 INFO L231 Difference]: Finished difference. Result has 1043 places, 1074 transitions, 2158 flow [2023-11-29 01:43:07,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2154, PETRI_DIFFERENCE_MINUEND_PLACES=1041, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1072, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2158, PETRI_PLACES=1043, PETRI_TRANSITIONS=1074} [2023-11-29 01:43:07,189 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -19 predicate places. [2023-11-29 01:43:07,189 INFO L495 AbstractCegarLoop]: Abstraction has has 1043 places, 1074 transitions, 2158 flow [2023-11-29 01:43:07,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:07,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:07,190 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] [2023-11-29 01:43:07,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:43:07,190 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:07,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash 764013974, now seen corresponding path program 1 times [2023-11-29 01:43:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:07,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036380092] [2023-11-29 01:43:07,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:07,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:07,241 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 01:43:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036380092] [2023-11-29 01:43:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036380092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752830693] [2023-11-29 01:43:07,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:07,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:07,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:07,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:07,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1101 out of 1139 [2023-11-29 01:43:07,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 1074 transitions, 2158 flow. Second operand has 3 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:07,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:07,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1101 of 1139 [2023-11-29 01:43:07,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:07,942 INFO L124 PetriNetUnfolderBase]: 47/1173 cut-off events. [2023-11-29 01:43:07,942 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2023-11-29 01:43:07,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 1173 events. 47/1173 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4796 event pairs, 10 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1080. Up to 35 conditions per place. [2023-11-29 01:43:07,986 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 14 selfloop transitions, 2 changer transitions 0/1073 dead transitions. [2023-11-29 01:43:07,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1044 places, 1073 transitions, 2188 flow [2023-11-29 01:43:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3320 transitions. [2023-11-29 01:43:07,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9716125256072579 [2023-11-29 01:43:07,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3320 transitions. [2023-11-29 01:43:07,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3320 transitions. [2023-11-29 01:43:07,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:07,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3320 transitions. [2023-11-29 01:43:08,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1106.6666666666667) internal successors, (3320), 3 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:08,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:08,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:08,010 INFO L175 Difference]: Start difference. First operand has 1043 places, 1074 transitions, 2158 flow. Second operand 3 states and 3320 transitions. [2023-11-29 01:43:08,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1044 places, 1073 transitions, 2188 flow [2023-11-29 01:43:08,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1042 places, 1073 transitions, 2184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:08,030 INFO L231 Difference]: Finished difference. Result has 1042 places, 1073 transitions, 2156 flow [2023-11-29 01:43:08,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=1040, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1073, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2156, PETRI_PLACES=1042, PETRI_TRANSITIONS=1073} [2023-11-29 01:43:08,032 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -20 predicate places. [2023-11-29 01:43:08,032 INFO L495 AbstractCegarLoop]: Abstraction has has 1042 places, 1073 transitions, 2156 flow [2023-11-29 01:43:08,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:08,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:08,033 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] [2023-11-29 01:43:08,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:43:08,033 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:08,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash -244654850, now seen corresponding path program 1 times [2023-11-29 01:43:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:08,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091110549] [2023-11-29 01:43:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:08,091 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 01:43:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:08,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091110549] [2023-11-29 01:43:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091110549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:08,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:08,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:08,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38675653] [2023-11-29 01:43:08,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:08,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:08,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1094 out of 1139 [2023-11-29 01:43:08,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1042 places, 1073 transitions, 2156 flow. Second operand has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:08,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:08,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1094 of 1139 [2023-11-29 01:43:08,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:08,929 INFO L124 PetriNetUnfolderBase]: 85/1620 cut-off events. [2023-11-29 01:43:08,930 INFO L125 PetriNetUnfolderBase]: For 27/29 co-relation queries the response was YES. [2023-11-29 01:43:08,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 1620 events. 85/1620 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8492 event pairs, 24 based on Foata normal form. 0/1311 useless extension candidates. Maximal degree in co-relation 1554. Up to 70 conditions per place. [2023-11-29 01:43:08,993 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 21 selfloop transitions, 2 changer transitions 0/1072 dead transitions. [2023-11-29 01:43:08,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1043 places, 1072 transitions, 2200 flow [2023-11-29 01:43:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3306 transitions. [2023-11-29 01:43:09,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9675153643546971 [2023-11-29 01:43:09,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3306 transitions. [2023-11-29 01:43:09,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3306 transitions. [2023-11-29 01:43:09,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:09,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3306 transitions. [2023-11-29 01:43:09,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1102.0) internal successors, (3306), 3 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:09,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:09,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:09,019 INFO L175 Difference]: Start difference. First operand has 1042 places, 1073 transitions, 2156 flow. Second operand 3 states and 3306 transitions. [2023-11-29 01:43:09,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1043 places, 1072 transitions, 2200 flow [2023-11-29 01:43:09,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 1072 transitions, 2196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:09,043 INFO L231 Difference]: Finished difference. Result has 1041 places, 1072 transitions, 2154 flow [2023-11-29 01:43:09,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1070, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2154, PETRI_PLACES=1041, PETRI_TRANSITIONS=1072} [2023-11-29 01:43:09,046 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -21 predicate places. [2023-11-29 01:43:09,046 INFO L495 AbstractCegarLoop]: Abstraction has has 1041 places, 1072 transitions, 2154 flow [2023-11-29 01:43:09,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:09,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:09,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:09,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:43:09,047 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:09,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1756512606, now seen corresponding path program 1 times [2023-11-29 01:43:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:09,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396678394] [2023-11-29 01:43:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:09,931 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 01:43:09,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:09,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396678394] [2023-11-29 01:43:09,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396678394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:09,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:43:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272879627] [2023-11-29 01:43:09,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:09,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:43:09,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:09,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:43:09,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:43:10,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1139 [2023-11-29 01:43:10,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 1072 transitions, 2154 flow. Second operand has 6 states, 6 states have (on average 1076.5) internal successors, (6459), 6 states have internal predecessors, (6459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:10,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:10,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1139 [2023-11-29 01:43:10,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:26,870 INFO L124 PetriNetUnfolderBase]: 4080/50058 cut-off events. [2023-11-29 01:43:26,870 INFO L125 PetriNetUnfolderBase]: For 62/143 co-relation queries the response was YES. [2023-11-29 01:43:27,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53018 conditions, 50058 events. 4080/50058 cut-off events. For 62/143 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 717918 event pairs, 1640 based on Foata normal form. 0/39307 useless extension candidates. Maximal degree in co-relation 52866. Up to 2920 conditions per place. [2023-11-29 01:43:27,983 INFO L140 encePairwiseOnDemand]: 1133/1139 looper letters, 38 selfloop transitions, 5 changer transitions 0/1071 dead transitions. [2023-11-29 01:43:27,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 1071 transitions, 2238 flow [2023-11-29 01:43:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:43:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:43:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6494 transitions. [2023-11-29 01:43:27,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9502487562189055 [2023-11-29 01:43:27,994 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 6494 transitions. [2023-11-29 01:43:27,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6494 transitions. [2023-11-29 01:43:27,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:27,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 6494 transitions. [2023-11-29 01:43:28,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1082.3333333333333) internal successors, (6494), 6 states have internal predecessors, (6494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:28,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1139.0) internal successors, (7973), 7 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:28,137 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1139.0) internal successors, (7973), 7 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:28,137 INFO L175 Difference]: Start difference. First operand has 1041 places, 1072 transitions, 2154 flow. Second operand 6 states and 6494 transitions. [2023-11-29 01:43:28,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 1071 transitions, 2238 flow [2023-11-29 01:43:28,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1043 places, 1071 transitions, 2234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:28,168 INFO L231 Difference]: Finished difference. Result has 1043 places, 1071 transitions, 2158 flow [2023-11-29 01:43:28,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=1038, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1071, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2158, PETRI_PLACES=1043, PETRI_TRANSITIONS=1071} [2023-11-29 01:43:28,170 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -19 predicate places. [2023-11-29 01:43:28,170 INFO L495 AbstractCegarLoop]: Abstraction has has 1043 places, 1071 transitions, 2158 flow [2023-11-29 01:43:28,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1076.5) internal successors, (6459), 6 states have internal predecessors, (6459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:28,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:28,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:28,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:43:28,172 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:28,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash 437456803, now seen corresponding path program 1 times [2023-11-29 01:43:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:28,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452433181] [2023-11-29 01:43:28,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:28,225 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 01:43:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452433181] [2023-11-29 01:43:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452433181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:28,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:28,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821362988] [2023-11-29 01:43:28,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:28,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:28,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:28,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:28,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:28,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1103 out of 1139 [2023-11-29 01:43:28,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 1071 transitions, 2158 flow. Second operand has 3 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:28,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:28,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1103 of 1139 [2023-11-29 01:43:28,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:28,990 INFO L124 PetriNetUnfolderBase]: 121/2662 cut-off events. [2023-11-29 01:43:28,990 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-11-29 01:43:29,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 2662 events. 121/2662 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14840 event pairs, 15 based on Foata normal form. 0/2137 useless extension candidates. Maximal degree in co-relation 2703. Up to 43 conditions per place. [2023-11-29 01:43:29,057 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 12 selfloop transitions, 2 changer transitions 0/1070 dead transitions. [2023-11-29 01:43:29,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1044 places, 1070 transitions, 2184 flow [2023-11-29 01:43:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3324 transitions. [2023-11-29 01:43:29,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9727831431079894 [2023-11-29 01:43:29,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3324 transitions. [2023-11-29 01:43:29,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3324 transitions. [2023-11-29 01:43:29,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:29,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3324 transitions. [2023-11-29 01:43:29,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1108.0) internal successors, (3324), 3 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:29,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:29,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:29,073 INFO L175 Difference]: Start difference. First operand has 1043 places, 1071 transitions, 2158 flow. Second operand 3 states and 3324 transitions. [2023-11-29 01:43:29,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1044 places, 1070 transitions, 2184 flow [2023-11-29 01:43:29,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1039 places, 1070 transitions, 2174 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:43:29,090 INFO L231 Difference]: Finished difference. Result has 1039 places, 1070 transitions, 2150 flow [2023-11-29 01:43:29,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=1037, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1070, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1068, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2150, PETRI_PLACES=1039, PETRI_TRANSITIONS=1070} [2023-11-29 01:43:29,092 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -23 predicate places. [2023-11-29 01:43:29,092 INFO L495 AbstractCegarLoop]: Abstraction has has 1039 places, 1070 transitions, 2150 flow [2023-11-29 01:43:29,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:29,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:29,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:29,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:43:29,094 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:29,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1409757807, now seen corresponding path program 1 times [2023-11-29 01:43:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:29,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127230914] [2023-11-29 01:43:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:29,151 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 01:43:29,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127230914] [2023-11-29 01:43:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127230914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:29,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:29,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:29,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938073686] [2023-11-29 01:43:29,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:29,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:29,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:29,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:29,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:29,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1102 out of 1139 [2023-11-29 01:43:29,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 1070 transitions, 2150 flow. Second operand has 3 states, 3 states have (on average 1103.6666666666667) internal successors, (3311), 3 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:29,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:29,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1102 of 1139 [2023-11-29 01:43:29,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:30,324 INFO L124 PetriNetUnfolderBase]: 163/3600 cut-off events. [2023-11-29 01:43:30,324 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2023-11-29 01:43:30,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 3600 events. 163/3600 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 23542 event pairs, 9 based on Foata normal form. 0/2872 useless extension candidates. Maximal degree in co-relation 3478. Up to 43 conditions per place. [2023-11-29 01:43:30,448 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 16 selfloop transitions, 2 changer transitions 0/1071 dead transitions. [2023-11-29 01:43:30,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 1071 transitions, 2190 flow [2023-11-29 01:43:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3325 transitions. [2023-11-29 01:43:30,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9730757974831724 [2023-11-29 01:43:30,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3325 transitions. [2023-11-29 01:43:30,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3325 transitions. [2023-11-29 01:43:30,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:30,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3325 transitions. [2023-11-29 01:43:30,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1108.3333333333333) internal successors, (3325), 3 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:30,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:30,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:30,463 INFO L175 Difference]: Start difference. First operand has 1039 places, 1070 transitions, 2150 flow. Second operand 3 states and 3325 transitions. [2023-11-29 01:43:30,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1040 places, 1071 transitions, 2190 flow [2023-11-29 01:43:30,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1038 places, 1071 transitions, 2186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:30,474 INFO L231 Difference]: Finished difference. Result has 1038 places, 1069 transitions, 2148 flow [2023-11-29 01:43:30,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=1036, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1067, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=1038, PETRI_TRANSITIONS=1069} [2023-11-29 01:43:30,475 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -24 predicate places. [2023-11-29 01:43:30,475 INFO L495 AbstractCegarLoop]: Abstraction has has 1038 places, 1069 transitions, 2148 flow [2023-11-29 01:43:30,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1103.6666666666667) internal successors, (3311), 3 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:30,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:30,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:30,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 01:43:30,476 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:30,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1188236437, now seen corresponding path program 1 times [2023-11-29 01:43:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:30,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171388371] [2023-11-29 01:43:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:30,517 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 01:43:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171388371] [2023-11-29 01:43:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171388371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:30,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:30,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:30,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227823877] [2023-11-29 01:43:30,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:30,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:30,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:30,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:43:30,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1038 places, 1069 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 1097.6666666666667) internal successors, (3293), 3 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:30,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:30,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:43:30,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:31,147 INFO L124 PetriNetUnfolderBase]: 115/2178 cut-off events. [2023-11-29 01:43:31,147 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:43:31,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 2178 events. 115/2178 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 13390 event pairs, 26 based on Foata normal form. 0/1759 useless extension candidates. Maximal degree in co-relation 2086. Up to 73 conditions per place. [2023-11-29 01:43:31,205 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 22 selfloop transitions, 2 changer transitions 0/1070 dead transitions. [2023-11-29 01:43:31,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 1070 transitions, 2200 flow [2023-11-29 01:43:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3313 transitions. [2023-11-29 01:43:31,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9695639449809774 [2023-11-29 01:43:31,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3313 transitions. [2023-11-29 01:43:31,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3313 transitions. [2023-11-29 01:43:31,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:31,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3313 transitions. [2023-11-29 01:43:31,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:31,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:31,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:31,217 INFO L175 Difference]: Start difference. First operand has 1038 places, 1069 transitions, 2148 flow. Second operand 3 states and 3313 transitions. [2023-11-29 01:43:31,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1039 places, 1070 transitions, 2200 flow [2023-11-29 01:43:31,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1037 places, 1070 transitions, 2196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:31,232 INFO L231 Difference]: Finished difference. Result has 1037 places, 1068 transitions, 2146 flow [2023-11-29 01:43:31,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=1035, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1068, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2146, PETRI_PLACES=1037, PETRI_TRANSITIONS=1068} [2023-11-29 01:43:31,233 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -25 predicate places. [2023-11-29 01:43:31,233 INFO L495 AbstractCegarLoop]: Abstraction has has 1037 places, 1068 transitions, 2146 flow [2023-11-29 01:43:31,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1097.6666666666667) internal successors, (3293), 3 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:31,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:31,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:31,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:43:31,234 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:31,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash -163591783, now seen corresponding path program 1 times [2023-11-29 01:43:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:31,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610407728] [2023-11-29 01:43:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,306 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 01:43:31,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:31,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610407728] [2023-11-29 01:43:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610407728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:31,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:31,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:31,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922849243] [2023-11-29 01:43:31,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:31,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:31,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1102 out of 1139 [2023-11-29 01:43:31,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1037 places, 1068 transitions, 2146 flow. Second operand has 3 states, 3 states have (on average 1104.0) internal successors, (3312), 3 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:31,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:31,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1102 of 1139 [2023-11-29 01:43:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:32,052 INFO L124 PetriNetUnfolderBase]: 79/1621 cut-off events. [2023-11-29 01:43:32,052 INFO L125 PetriNetUnfolderBase]: For 12/21 co-relation queries the response was YES. [2023-11-29 01:43:32,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 1621 events. 79/1621 cut-off events. For 12/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8058 event pairs, 14 based on Foata normal form. 0/1315 useless extension candidates. Maximal degree in co-relation 1473. Up to 43 conditions per place. [2023-11-29 01:43:32,090 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 16 selfloop transitions, 2 changer transitions 0/1069 dead transitions. [2023-11-29 01:43:32,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1038 places, 1069 transitions, 2186 flow [2023-11-29 01:43:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3325 transitions. [2023-11-29 01:43:32,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9730757974831724 [2023-11-29 01:43:32,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3325 transitions. [2023-11-29 01:43:32,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3325 transitions. [2023-11-29 01:43:32,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:32,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3325 transitions. [2023-11-29 01:43:32,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1108.3333333333333) internal successors, (3325), 3 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:32,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:32,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:32,098 INFO L175 Difference]: Start difference. First operand has 1037 places, 1068 transitions, 2146 flow. Second operand 3 states and 3325 transitions. [2023-11-29 01:43:32,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1038 places, 1069 transitions, 2186 flow [2023-11-29 01:43:32,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 1069 transitions, 2182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:32,113 INFO L231 Difference]: Finished difference. Result has 1036 places, 1067 transitions, 2144 flow [2023-11-29 01:43:32,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1065, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2144, PETRI_PLACES=1036, PETRI_TRANSITIONS=1067} [2023-11-29 01:43:32,115 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -26 predicate places. [2023-11-29 01:43:32,115 INFO L495 AbstractCegarLoop]: Abstraction has has 1036 places, 1067 transitions, 2144 flow [2023-11-29 01:43:32,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1104.0) internal successors, (3312), 3 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:32,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:32,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:32,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:43:32,116 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:32,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 371298100, now seen corresponding path program 1 times [2023-11-29 01:43:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575287834] [2023-11-29 01:43:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:32,171 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 01:43:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575287834] [2023-11-29 01:43:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575287834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:32,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276339663] [2023-11-29 01:43:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:32,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:32,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1082 out of 1139 [2023-11-29 01:43:32,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1067 transitions, 2144 flow. Second operand has 3 states, 3 states have (on average 1083.3333333333333) internal successors, (3250), 3 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:32,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:32,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1082 of 1139 [2023-11-29 01:43:32,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:35,348 INFO L124 PetriNetUnfolderBase]: 847/10617 cut-off events. [2023-11-29 01:43:35,348 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-29 01:43:35,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11417 conditions, 10617 events. 847/10617 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 103906 event pairs, 190 based on Foata normal form. 0/8476 useless extension candidates. Maximal degree in co-relation 10904. Up to 658 conditions per place. [2023-11-29 01:43:35,530 INFO L140 encePairwiseOnDemand]: 1127/1139 looper letters, 29 selfloop transitions, 2 changer transitions 0/1061 dead transitions. [2023-11-29 01:43:35,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1061 transitions, 2196 flow [2023-11-29 01:43:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3287 transitions. [2023-11-29 01:43:35,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9619549312262218 [2023-11-29 01:43:35,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3287 transitions. [2023-11-29 01:43:35,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3287 transitions. [2023-11-29 01:43:35,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:35,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3287 transitions. [2023-11-29 01:43:35,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1095.6666666666667) internal successors, (3287), 3 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:35,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:35,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:35,537 INFO L175 Difference]: Start difference. First operand has 1036 places, 1067 transitions, 2144 flow. Second operand 3 states and 3287 transitions. [2023-11-29 01:43:35,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1061 transitions, 2196 flow [2023-11-29 01:43:35,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1061 transitions, 2192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:35,549 INFO L231 Difference]: Finished difference. Result has 1027 places, 1059 transitions, 2134 flow [2023-11-29 01:43:35,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2134, PETRI_PLACES=1027, PETRI_TRANSITIONS=1059} [2023-11-29 01:43:35,551 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -35 predicate places. [2023-11-29 01:43:35,551 INFO L495 AbstractCegarLoop]: Abstraction has has 1027 places, 1059 transitions, 2134 flow [2023-11-29 01:43:35,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1083.3333333333333) internal successors, (3250), 3 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:35,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:35,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:35,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 01:43:35,551 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:35,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash 335270486, now seen corresponding path program 1 times [2023-11-29 01:43:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509616062] [2023-11-29 01:43:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:35,605 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 01:43:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:35,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509616062] [2023-11-29 01:43:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509616062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:35,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:35,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:35,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840800813] [2023-11-29 01:43:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:35,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:35,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:35,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:35,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1082 out of 1139 [2023-11-29 01:43:35,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1059 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 1083.3333333333333) internal successors, (3250), 3 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:35,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:35,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1082 of 1139 [2023-11-29 01:43:35,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:37,985 INFO L124 PetriNetUnfolderBase]: 452/6447 cut-off events. [2023-11-29 01:43:37,985 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 01:43:38,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6820 conditions, 6447 events. 452/6447 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 53592 event pairs, 110 based on Foata normal form. 0/5196 useless extension candidates. Maximal degree in co-relation 6345. Up to 337 conditions per place. [2023-11-29 01:43:38,157 INFO L140 encePairwiseOnDemand]: 1127/1139 looper letters, 29 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2023-11-29 01:43:38,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1053 transitions, 2186 flow [2023-11-29 01:43:38,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3287 transitions. [2023-11-29 01:43:38,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9619549312262218 [2023-11-29 01:43:38,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3287 transitions. [2023-11-29 01:43:38,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3287 transitions. [2023-11-29 01:43:38,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:38,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3287 transitions. [2023-11-29 01:43:38,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1095.6666666666667) internal successors, (3287), 3 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:38,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:38,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:38,164 INFO L175 Difference]: Start difference. First operand has 1027 places, 1059 transitions, 2134 flow. Second operand 3 states and 3287 transitions. [2023-11-29 01:43:38,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1053 transitions, 2186 flow [2023-11-29 01:43:38,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1053 transitions, 2186 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:43:38,175 INFO L231 Difference]: Finished difference. Result has 1020 places, 1051 transitions, 2128 flow [2023-11-29 01:43:38,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1020, PETRI_TRANSITIONS=1051} [2023-11-29 01:43:38,177 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -42 predicate places. [2023-11-29 01:43:38,177 INFO L495 AbstractCegarLoop]: Abstraction has has 1020 places, 1051 transitions, 2128 flow [2023-11-29 01:43:38,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1083.3333333333333) internal successors, (3250), 3 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:38,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:38,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:38,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 01:43:38,178 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:38,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1122418027, now seen corresponding path program 1 times [2023-11-29 01:43:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591711742] [2023-11-29 01:43:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:38,232 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 01:43:38,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:38,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591711742] [2023-11-29 01:43:38,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591711742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:38,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:38,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530938586] [2023-11-29 01:43:38,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:38,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:38,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:43:38,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1051 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:38,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:38,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:43:38,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:39,324 INFO L124 PetriNetUnfolderBase]: 166/2908 cut-off events. [2023-11-29 01:43:39,324 INFO L125 PetriNetUnfolderBase]: For 18/45 co-relation queries the response was YES. [2023-11-29 01:43:39,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3077 conditions, 2908 events. 166/2908 cut-off events. For 18/45 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20790 event pairs, 26 based on Foata normal form. 0/2372 useless extension candidates. Maximal degree in co-relation 2289. Up to 106 conditions per place. [2023-11-29 01:43:39,402 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 22 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2023-11-29 01:43:39,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1052 transitions, 2180 flow [2023-11-29 01:43:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3313 transitions. [2023-11-29 01:43:39,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9695639449809774 [2023-11-29 01:43:39,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3313 transitions. [2023-11-29 01:43:39,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3313 transitions. [2023-11-29 01:43:39,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:39,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3313 transitions. [2023-11-29 01:43:39,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:39,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:39,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:39,414 INFO L175 Difference]: Start difference. First operand has 1020 places, 1051 transitions, 2128 flow. Second operand 3 states and 3313 transitions. [2023-11-29 01:43:39,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1052 transitions, 2180 flow [2023-11-29 01:43:39,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1052 transitions, 2180 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:43:39,429 INFO L231 Difference]: Finished difference. Result has 1021 places, 1050 transitions, 2130 flow [2023-11-29 01:43:39,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1021, PETRI_TRANSITIONS=1050} [2023-11-29 01:43:39,430 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -41 predicate places. [2023-11-29 01:43:39,430 INFO L495 AbstractCegarLoop]: Abstraction has has 1021 places, 1050 transitions, 2130 flow [2023-11-29 01:43:39,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:39,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:39,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:39,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 01:43:39,431 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:39,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:39,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2090962059, now seen corresponding path program 1 times [2023-11-29 01:43:39,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:39,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355273280] [2023-11-29 01:43:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:39,481 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 01:43:39,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:39,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355273280] [2023-11-29 01:43:39,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355273280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:39,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:39,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065471450] [2023-11-29 01:43:39,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:39,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:39,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1102 out of 1139 [2023-11-29 01:43:39,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1050 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:39,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:39,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1102 of 1139 [2023-11-29 01:43:39,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:40,371 INFO L124 PetriNetUnfolderBase]: 105/2097 cut-off events. [2023-11-29 01:43:40,372 INFO L125 PetriNetUnfolderBase]: For 21/23 co-relation queries the response was YES. [2023-11-29 01:43:40,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 2097 events. 105/2097 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11842 event pairs, 14 based on Foata normal form. 0/1721 useless extension candidates. Maximal degree in co-relation 1951. Up to 48 conditions per place. [2023-11-29 01:43:40,436 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 16 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2023-11-29 01:43:40,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1051 transitions, 2170 flow [2023-11-29 01:43:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3325 transitions. [2023-11-29 01:43:40,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9730757974831724 [2023-11-29 01:43:40,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3325 transitions. [2023-11-29 01:43:40,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3325 transitions. [2023-11-29 01:43:40,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:40,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3325 transitions. [2023-11-29 01:43:40,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1108.3333333333333) internal successors, (3325), 3 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:40,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:40,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:40,449 INFO L175 Difference]: Start difference. First operand has 1021 places, 1050 transitions, 2130 flow. Second operand 3 states and 3325 transitions. [2023-11-29 01:43:40,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1051 transitions, 2170 flow [2023-11-29 01:43:40,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1051 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:40,465 INFO L231 Difference]: Finished difference. Result has 1020 places, 1049 transitions, 2128 flow [2023-11-29 01:43:40,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1020, PETRI_TRANSITIONS=1049} [2023-11-29 01:43:40,466 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -42 predicate places. [2023-11-29 01:43:40,466 INFO L495 AbstractCegarLoop]: Abstraction has has 1020 places, 1049 transitions, 2128 flow [2023-11-29 01:43:40,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:40,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:40,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:40,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 01:43:40,467 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:40,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2048334958, now seen corresponding path program 1 times [2023-11-29 01:43:40,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:40,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092521223] [2023-11-29 01:43:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:40,556 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 01:43:40,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092521223] [2023-11-29 01:43:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092521223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:40,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:40,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387490479] [2023-11-29 01:43:40,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:40,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:40,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1093 out of 1139 [2023-11-29 01:43:40,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1049 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1094.3333333333333) internal successors, (3283), 3 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:40,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:40,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1093 of 1139 [2023-11-29 01:43:40,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:41,702 INFO L124 PetriNetUnfolderBase]: 191/3812 cut-off events. [2023-11-29 01:43:41,702 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 01:43:41,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 3812 events. 191/3812 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 26134 event pairs, 8 based on Foata normal form. 0/3113 useless extension candidates. Maximal degree in co-relation 3478. Up to 42 conditions per place. [2023-11-29 01:43:41,808 INFO L140 encePairwiseOnDemand]: 1125/1139 looper letters, 18 selfloop transitions, 9 changer transitions 0/1050 dead transitions. [2023-11-29 01:43:41,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1050 transitions, 2186 flow [2023-11-29 01:43:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3311 transitions. [2023-11-29 01:43:41,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9689786362306116 [2023-11-29 01:43:41,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3311 transitions. [2023-11-29 01:43:41,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3311 transitions. [2023-11-29 01:43:41,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:41,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3311 transitions. [2023-11-29 01:43:41,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1103.6666666666667) internal successors, (3311), 3 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:41,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:41,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:41,815 INFO L175 Difference]: Start difference. First operand has 1020 places, 1049 transitions, 2128 flow. Second operand 3 states and 3311 transitions. [2023-11-29 01:43:41,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1050 transitions, 2186 flow [2023-11-29 01:43:41,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1050 transitions, 2182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:41,827 INFO L231 Difference]: Finished difference. Result has 1016 places, 1048 transitions, 2157 flow [2023-11-29 01:43:41,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2157, PETRI_PLACES=1016, PETRI_TRANSITIONS=1048} [2023-11-29 01:43:41,828 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -46 predicate places. [2023-11-29 01:43:41,828 INFO L495 AbstractCegarLoop]: Abstraction has has 1016 places, 1048 transitions, 2157 flow [2023-11-29 01:43:41,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1094.3333333333333) internal successors, (3283), 3 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:41,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:41,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:41,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 01:43:41,829 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:41,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1885552485, now seen corresponding path program 1 times [2023-11-29 01:43:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:41,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442461339] [2023-11-29 01:43:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:41,968 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 01:43:41,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:41,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442461339] [2023-11-29 01:43:41,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442461339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:41,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:41,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:43:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941723282] [2023-11-29 01:43:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:41,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:43:41,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:41,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:43:41,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:42,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1104 out of 1139 [2023-11-29 01:43:42,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1048 transitions, 2157 flow. Second operand has 5 states, 5 states have (on average 1106.2) internal successors, (5531), 5 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:42,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:42,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1104 of 1139 [2023-11-29 01:43:42,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:42,525 INFO L124 PetriNetUnfolderBase]: 63/1574 cut-off events. [2023-11-29 01:43:42,525 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-29 01:43:42,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 1574 events. 63/1574 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7634 event pairs, 0 based on Foata normal form. 1/1317 useless extension candidates. Maximal degree in co-relation 1538. Up to 9 conditions per place. [2023-11-29 01:43:42,567 INFO L140 encePairwiseOnDemand]: 1132/1139 looper letters, 10 selfloop transitions, 6 changer transitions 0/1049 dead transitions. [2023-11-29 01:43:42,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1049 transitions, 2191 flow [2023-11-29 01:43:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:43:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:43:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5537 transitions. [2023-11-29 01:43:42,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9722563652326602 [2023-11-29 01:43:42,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 5537 transitions. [2023-11-29 01:43:42,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5537 transitions. [2023-11-29 01:43:42,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:42,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 5537 transitions. [2023-11-29 01:43:42,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1107.4) internal successors, (5537), 5 states have internal predecessors, (5537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:42,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1139.0) internal successors, (6834), 6 states have internal predecessors, (6834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:42,583 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1139.0) internal successors, (6834), 6 states have internal predecessors, (6834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:42,583 INFO L175 Difference]: Start difference. First operand has 1016 places, 1048 transitions, 2157 flow. Second operand 5 states and 5537 transitions. [2023-11-29 01:43:42,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1049 transitions, 2191 flow [2023-11-29 01:43:42,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1049 transitions, 2182 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:43:42,600 INFO L231 Difference]: Finished difference. Result has 1020 places, 1049 transitions, 2168 flow [2023-11-29 01:43:42,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2168, PETRI_PLACES=1020, PETRI_TRANSITIONS=1049} [2023-11-29 01:43:42,602 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -42 predicate places. [2023-11-29 01:43:42,602 INFO L495 AbstractCegarLoop]: Abstraction has has 1020 places, 1049 transitions, 2168 flow [2023-11-29 01:43:42,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1106.2) internal successors, (5531), 5 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:42,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:42,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:42,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 01:43:42,603 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:42,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1925235633, now seen corresponding path program 1 times [2023-11-29 01:43:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494900612] [2023-11-29 01:43:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:42,784 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 01:43:42,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:42,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494900612] [2023-11-29 01:43:42,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494900612] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:43:42,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846679543] [2023-11-29 01:43:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:42,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:43:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:43:42,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:43:42,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:43:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:42,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:43:42,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:43,155 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 01:43:43,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:43:43,256 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 01:43:43,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846679543] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:43:43,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:43:43,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-29 01:43:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158059468] [2023-11-29 01:43:43,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:43:43,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:43:43,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:43,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:43:43,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:43:43,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1101 out of 1139 [2023-11-29 01:43:43,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1049 transitions, 2168 flow. Second operand has 14 states, 14 states have (on average 1103.142857142857) internal successors, (15444), 14 states have internal predecessors, (15444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:43,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:43,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1101 of 1139 [2023-11-29 01:43:43,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:44,186 INFO L124 PetriNetUnfolderBase]: 63/1591 cut-off events. [2023-11-29 01:43:44,187 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-29 01:43:44,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 1591 events. 63/1591 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7614 event pairs, 0 based on Foata normal form. 2/1335 useless extension candidates. Maximal degree in co-relation 1416. Up to 9 conditions per place. [2023-11-29 01:43:44,249 INFO L140 encePairwiseOnDemand]: 1129/1139 looper letters, 14 selfloop transitions, 13 changer transitions 0/1057 dead transitions. [2023-11-29 01:43:44,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1057 transitions, 2240 flow [2023-11-29 01:43:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:43:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 01:43:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12140 transitions. [2023-11-29 01:43:44,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9689520312874133 [2023-11-29 01:43:44,257 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 12140 transitions. [2023-11-29 01:43:44,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12140 transitions. [2023-11-29 01:43:44,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:44,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 12140 transitions. [2023-11-29 01:43:44,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 1103.6363636363637) internal successors, (12140), 11 states have internal predecessors, (12140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:44,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1139.0) internal successors, (13668), 12 states have internal predecessors, (13668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:44,274 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1139.0) internal successors, (13668), 12 states have internal predecessors, (13668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:44,274 INFO L175 Difference]: Start difference. First operand has 1020 places, 1049 transitions, 2168 flow. Second operand 11 states and 12140 transitions. [2023-11-29 01:43:44,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1057 transitions, 2240 flow [2023-11-29 01:43:44,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1057 transitions, 2230 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:43:44,288 INFO L231 Difference]: Finished difference. Result has 1030 places, 1055 transitions, 2218 flow [2023-11-29 01:43:44,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1039, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2218, PETRI_PLACES=1030, PETRI_TRANSITIONS=1055} [2023-11-29 01:43:44,289 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -32 predicate places. [2023-11-29 01:43:44,289 INFO L495 AbstractCegarLoop]: Abstraction has has 1030 places, 1055 transitions, 2218 flow [2023-11-29 01:43:44,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1103.142857142857) internal successors, (15444), 14 states have internal predecessors, (15444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:44,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:44,292 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 01:43:44,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:43:44,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f9c0ad3-dfce-4fea-bbdd-2a9d7029578d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 01:43:44,492 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:44,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash 843224463, now seen corresponding path program 2 times [2023-11-29 01:43:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458816727] [2023-11-29 01:43:44,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:45,276 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 01:43:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:45,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458816727] [2023-11-29 01:43:45,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458816727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:45,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:45,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:43:45,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003504161] [2023-11-29 01:43:45,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:45,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:43:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:45,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:43:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:43:45,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1099 out of 1139 [2023-11-29 01:43:45,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 1055 transitions, 2218 flow. Second operand has 6 states, 6 states have (on average 1101.3333333333333) internal successors, (6608), 6 states have internal predecessors, (6608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:45,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:45,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1099 of 1139 [2023-11-29 01:43:45,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:46,142 INFO L124 PetriNetUnfolderBase]: 63/1590 cut-off events. [2023-11-29 01:43:46,142 INFO L125 PetriNetUnfolderBase]: For 9/16 co-relation queries the response was YES. [2023-11-29 01:43:46,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 1590 events. 63/1590 cut-off events. For 9/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7627 event pairs, 0 based on Foata normal form. 4/1337 useless extension candidates. Maximal degree in co-relation 1418. Up to 18 conditions per place. [2023-11-29 01:43:46,190 INFO L140 encePairwiseOnDemand]: 1134/1139 looper letters, 13 selfloop transitions, 4 changer transitions 0/1054 dead transitions. [2023-11-29 01:43:46,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1054 transitions, 2250 flow [2023-11-29 01:43:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:43:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:43:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6612 transitions. [2023-11-29 01:43:46,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9675153643546971 [2023-11-29 01:43:46,195 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 6612 transitions. [2023-11-29 01:43:46,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6612 transitions. [2023-11-29 01:43:46,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:46,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 6612 transitions. [2023-11-29 01:43:46,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1102.0) internal successors, (6612), 6 states have internal predecessors, (6612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:46,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1139.0) internal successors, (7973), 7 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:46,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1139.0) internal successors, (7973), 7 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:46,203 INFO L175 Difference]: Start difference. First operand has 1030 places, 1055 transitions, 2218 flow. Second operand 6 states and 6612 transitions. [2023-11-29 01:43:46,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1054 transitions, 2250 flow [2023-11-29 01:43:46,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1054 transitions, 2238 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-29 01:43:46,218 INFO L231 Difference]: Finished difference. Result has 1031 places, 1054 transitions, 2212 flow [2023-11-29 01:43:46,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2212, PETRI_PLACES=1031, PETRI_TRANSITIONS=1054} [2023-11-29 01:43:46,220 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -31 predicate places. [2023-11-29 01:43:46,220 INFO L495 AbstractCegarLoop]: Abstraction has has 1031 places, 1054 transitions, 2212 flow [2023-11-29 01:43:46,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1101.3333333333333) internal successors, (6608), 6 states have internal predecessors, (6608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:46,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:46,222 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 01:43:46,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 01:43:46,222 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:46,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1137891478, now seen corresponding path program 1 times [2023-11-29 01:43:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308581643] [2023-11-29 01:43:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:46,296 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 01:43:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308581643] [2023-11-29 01:43:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308581643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:46,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:46,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:46,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490615616] [2023-11-29 01:43:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:46,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:46,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:46,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:46,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1082 out of 1139 [2023-11-29 01:43:46,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1054 transitions, 2212 flow. Second operand has 3 states, 3 states have (on average 1083.6666666666667) internal successors, (3251), 3 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:46,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:46,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1082 of 1139 [2023-11-29 01:43:46,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:51,757 INFO L124 PetriNetUnfolderBase]: 1568/19947 cut-off events. [2023-11-29 01:43:51,758 INFO L125 PetriNetUnfolderBase]: For 146/152 co-relation queries the response was YES. [2023-11-29 01:43:51,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21221 conditions, 19947 events. 1568/19947 cut-off events. For 146/152 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 223349 event pairs, 370 based on Foata normal form. 0/16086 useless extension candidates. Maximal degree in co-relation 20973. Up to 1183 conditions per place. [2023-11-29 01:43:52,122 INFO L140 encePairwiseOnDemand]: 1127/1139 looper letters, 29 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2023-11-29 01:43:52,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1048 transitions, 2264 flow [2023-11-29 01:43:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3287 transitions. [2023-11-29 01:43:52,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9619549312262218 [2023-11-29 01:43:52,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3287 transitions. [2023-11-29 01:43:52,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3287 transitions. [2023-11-29 01:43:52,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:52,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3287 transitions. [2023-11-29 01:43:52,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1095.6666666666667) internal successors, (3287), 3 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:52,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:52,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:52,129 INFO L175 Difference]: Start difference. First operand has 1031 places, 1054 transitions, 2212 flow. Second operand 3 states and 3287 transitions. [2023-11-29 01:43:52,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1048 transitions, 2264 flow [2023-11-29 01:43:52,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1048 transitions, 2257 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:43:52,143 INFO L231 Difference]: Finished difference. Result has 1020 places, 1046 transitions, 2199 flow [2023-11-29 01:43:52,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2199, PETRI_PLACES=1020, PETRI_TRANSITIONS=1046} [2023-11-29 01:43:52,144 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -42 predicate places. [2023-11-29 01:43:52,145 INFO L495 AbstractCegarLoop]: Abstraction has has 1020 places, 1046 transitions, 2199 flow [2023-11-29 01:43:52,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1083.6666666666667) internal successors, (3251), 3 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:52,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:52,145 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 01:43:52,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 01:43:52,146 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:52,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1325849005, now seen corresponding path program 1 times [2023-11-29 01:43:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979559945] [2023-11-29 01:43:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:52,218 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 01:43:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:52,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979559945] [2023-11-29 01:43:52,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979559945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:52,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643900406] [2023-11-29 01:43:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:52,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:52,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:52,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1099 out of 1139 [2023-11-29 01:43:52,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1046 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 1100.6666666666667) internal successors, (3302), 3 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:52,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:52,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1099 of 1139 [2023-11-29 01:43:52,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:53,910 INFO L124 PetriNetUnfolderBase]: 261/5159 cut-off events. [2023-11-29 01:43:53,910 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-29 01:43:53,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5391 conditions, 5159 events. 261/5159 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 44635 event pairs, 20 based on Foata normal form. 0/4268 useless extension candidates. Maximal degree in co-relation 5143. Up to 68 conditions per place. [2023-11-29 01:43:54,014 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 22 selfloop transitions, 3 changer transitions 0/1047 dead transitions. [2023-11-29 01:43:54,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1047 transitions, 2253 flow [2023-11-29 01:43:54,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3319 transitions. [2023-11-29 01:43:54,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.971319871232075 [2023-11-29 01:43:54,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3319 transitions. [2023-11-29 01:43:54,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3319 transitions. [2023-11-29 01:43:54,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:54,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3319 transitions. [2023-11-29 01:43:54,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1106.3333333333333) internal successors, (3319), 3 states have internal predecessors, (3319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:54,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:54,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:54,023 INFO L175 Difference]: Start difference. First operand has 1020 places, 1046 transitions, 2199 flow. Second operand 3 states and 3319 transitions. [2023-11-29 01:43:54,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1047 transitions, 2253 flow [2023-11-29 01:43:54,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1047 transitions, 2253 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:43:54,036 INFO L231 Difference]: Finished difference. Result has 1021 places, 1045 transitions, 2203 flow [2023-11-29 01:43:54,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2203, PETRI_PLACES=1021, PETRI_TRANSITIONS=1045} [2023-11-29 01:43:54,038 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -41 predicate places. [2023-11-29 01:43:54,038 INFO L495 AbstractCegarLoop]: Abstraction has has 1021 places, 1045 transitions, 2203 flow [2023-11-29 01:43:54,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1100.6666666666667) internal successors, (3302), 3 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:54,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:54,039 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] [2023-11-29 01:43:54,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 01:43:54,039 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:54,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1681641975, now seen corresponding path program 1 times [2023-11-29 01:43:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:54,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830779486] [2023-11-29 01:43:54,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:54,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:54,113 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 01:43:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:54,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830779486] [2023-11-29 01:43:54,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830779486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:54,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:54,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140055670] [2023-11-29 01:43:54,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:54,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:54,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:43:54,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1045 transitions, 2203 flow. Second operand has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:54,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:54,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:43:54,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:55,299 INFO L124 PetriNetUnfolderBase]: 180/3101 cut-off events. [2023-11-29 01:43:55,299 INFO L125 PetriNetUnfolderBase]: For 50/52 co-relation queries the response was YES. [2023-11-29 01:43:55,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 3101 events. 180/3101 cut-off events. For 50/52 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 22367 event pairs, 37 based on Foata normal form. 0/2579 useless extension candidates. Maximal degree in co-relation 3088. Up to 139 conditions per place. [2023-11-29 01:43:55,381 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 22 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2023-11-29 01:43:55,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1046 transitions, 2255 flow [2023-11-29 01:43:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3313 transitions. [2023-11-29 01:43:55,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9695639449809774 [2023-11-29 01:43:55,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3313 transitions. [2023-11-29 01:43:55,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3313 transitions. [2023-11-29 01:43:55,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:55,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3313 transitions. [2023-11-29 01:43:55,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:55,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:55,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:55,389 INFO L175 Difference]: Start difference. First operand has 1021 places, 1045 transitions, 2203 flow. Second operand 3 states and 3313 transitions. [2023-11-29 01:43:55,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1046 transitions, 2255 flow [2023-11-29 01:43:55,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1046 transitions, 2249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:55,401 INFO L231 Difference]: Finished difference. Result has 1020 places, 1044 transitions, 2199 flow [2023-11-29 01:43:55,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2199, PETRI_PLACES=1020, PETRI_TRANSITIONS=1044} [2023-11-29 01:43:55,402 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -42 predicate places. [2023-11-29 01:43:55,402 INFO L495 AbstractCegarLoop]: Abstraction has has 1020 places, 1044 transitions, 2199 flow [2023-11-29 01:43:55,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:55,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:55,403 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] [2023-11-29 01:43:55,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 01:43:55,403 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:55,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1249025050, now seen corresponding path program 1 times [2023-11-29 01:43:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62708662] [2023-11-29 01:43:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:55,473 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 01:43:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62708662] [2023-11-29 01:43:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62708662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:55,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571961768] [2023-11-29 01:43:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:55,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:55,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:55,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1139 [2023-11-29 01:43:55,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1044 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 1091.6666666666667) internal successors, (3275), 3 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:55,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:55,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1139 [2023-11-29 01:43:55,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:57,165 INFO L124 PetriNetUnfolderBase]: 298/5638 cut-off events. [2023-11-29 01:43:57,166 INFO L125 PetriNetUnfolderBase]: For 19/33 co-relation queries the response was YES. [2023-11-29 01:43:57,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5929 conditions, 5638 events. 298/5638 cut-off events. For 19/33 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 46175 event pairs, 15 based on Foata normal form. 0/4682 useless extension candidates. Maximal degree in co-relation 5680. Up to 68 conditions per place. [2023-11-29 01:43:57,291 INFO L140 encePairwiseOnDemand]: 1124/1139 looper letters, 20 selfloop transitions, 9 changer transitions 0/1044 dead transitions. [2023-11-29 01:43:57,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1044 transitions, 2259 flow [2023-11-29 01:43:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3305 transitions. [2023-11-29 01:43:57,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9672227099795142 [2023-11-29 01:43:57,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3305 transitions. [2023-11-29 01:43:57,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3305 transitions. [2023-11-29 01:43:57,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:57,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3305 transitions. [2023-11-29 01:43:57,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1101.6666666666667) internal successors, (3305), 3 states have internal predecessors, (3305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:57,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:57,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:57,297 INFO L175 Difference]: Start difference. First operand has 1020 places, 1044 transitions, 2199 flow. Second operand 3 states and 3305 transitions. [2023-11-29 01:43:57,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1044 transitions, 2259 flow [2023-11-29 01:43:57,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1044 transitions, 2255 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:43:57,307 INFO L231 Difference]: Finished difference. Result has 1015 places, 1042 transitions, 2226 flow [2023-11-29 01:43:57,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2226, PETRI_PLACES=1015, PETRI_TRANSITIONS=1042} [2023-11-29 01:43:57,308 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -47 predicate places. [2023-11-29 01:43:57,308 INFO L495 AbstractCegarLoop]: Abstraction has has 1015 places, 1042 transitions, 2226 flow [2023-11-29 01:43:57,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1091.6666666666667) internal successors, (3275), 3 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:57,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:57,309 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 01:43:57,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 01:43:57,309 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:57,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1864602877, now seen corresponding path program 1 times [2023-11-29 01:43:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399826317] [2023-11-29 01:43:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:57,381 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 01:43:57,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:57,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399826317] [2023-11-29 01:43:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399826317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:57,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:57,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726218421] [2023-11-29 01:43:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:57,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:57,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:57,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1098 out of 1139 [2023-11-29 01:43:57,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1042 transitions, 2226 flow. Second operand has 3 states, 3 states have (on average 1100.0) internal successors, (3300), 3 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:57,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:57,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1098 of 1139 [2023-11-29 01:43:57,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:43:59,234 INFO L124 PetriNetUnfolderBase]: 285/5470 cut-off events. [2023-11-29 01:43:59,234 INFO L125 PetriNetUnfolderBase]: For 118/171 co-relation queries the response was YES. [2023-11-29 01:43:59,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 5470 events. 285/5470 cut-off events. For 118/171 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 48533 event pairs, 24 based on Foata normal form. 0/4547 useless extension candidates. Maximal degree in co-relation 5562. Up to 105 conditions per place. [2023-11-29 01:43:59,328 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 23 selfloop transitions, 3 changer transitions 0/1043 dead transitions. [2023-11-29 01:43:59,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1043 transitions, 2282 flow [2023-11-29 01:43:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:43:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3317 transitions. [2023-11-29 01:43:59,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9707345624817091 [2023-11-29 01:43:59,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3317 transitions. [2023-11-29 01:43:59,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3317 transitions. [2023-11-29 01:43:59,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:43:59,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3317 transitions. [2023-11-29 01:43:59,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1105.6666666666667) internal successors, (3317), 3 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:59,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:59,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:59,340 INFO L175 Difference]: Start difference. First operand has 1015 places, 1042 transitions, 2226 flow. Second operand 3 states and 3317 transitions. [2023-11-29 01:43:59,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1043 transitions, 2282 flow [2023-11-29 01:43:59,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1043 transitions, 2273 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:43:59,356 INFO L231 Difference]: Finished difference. Result has 1015 places, 1041 transitions, 2221 flow [2023-11-29 01:43:59,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2215, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2221, PETRI_PLACES=1015, PETRI_TRANSITIONS=1041} [2023-11-29 01:43:59,358 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -47 predicate places. [2023-11-29 01:43:59,358 INFO L495 AbstractCegarLoop]: Abstraction has has 1015 places, 1041 transitions, 2221 flow [2023-11-29 01:43:59,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1100.0) internal successors, (3300), 3 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:59,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:43:59,359 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] [2023-11-29 01:43:59,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 01:43:59,359 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:43:59,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1946678754, now seen corresponding path program 1 times [2023-11-29 01:43:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:59,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310768649] [2023-11-29 01:43:59,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:59,434 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 01:43:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:59,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310768649] [2023-11-29 01:43:59,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310768649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:59,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:59,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922910516] [2023-11-29 01:43:59,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:59,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:59,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:59,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:59,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:59,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1139 [2023-11-29 01:43:59,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1041 transitions, 2221 flow. Second operand has 3 states, 3 states have (on average 1092.0) internal successors, (3276), 3 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:59,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:43:59,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1139 [2023-11-29 01:43:59,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:00,642 INFO L124 PetriNetUnfolderBase]: 174/3233 cut-off events. [2023-11-29 01:44:00,642 INFO L125 PetriNetUnfolderBase]: For 47/49 co-relation queries the response was YES. [2023-11-29 01:44:00,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 3233 events. 174/3233 cut-off events. For 47/49 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 22808 event pairs, 21 based on Foata normal form. 1/2742 useless extension candidates. Maximal degree in co-relation 3267. Up to 91 conditions per place. [2023-11-29 01:44:00,750 INFO L140 encePairwiseOnDemand]: 1124/1139 looper letters, 16 selfloop transitions, 8 changer transitions 15/1041 dead transitions. [2023-11-29 01:44:00,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 1041 transitions, 2279 flow [2023-11-29 01:44:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3304 transitions. [2023-11-29 01:44:00,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9669300556043313 [2023-11-29 01:44:00,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3304 transitions. [2023-11-29 01:44:00,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3304 transitions. [2023-11-29 01:44:00,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:00,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3304 transitions. [2023-11-29 01:44:00,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:00,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:00,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:00,760 INFO L175 Difference]: Start difference. First operand has 1015 places, 1041 transitions, 2221 flow. Second operand 3 states and 3304 transitions. [2023-11-29 01:44:00,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1011 places, 1041 transitions, 2279 flow [2023-11-29 01:44:00,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 1041 transitions, 2273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:00,775 INFO L231 Difference]: Finished difference. Result has 1010 places, 1024 transitions, 2208 flow [2023-11-29 01:44:00,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1035, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2208, PETRI_PLACES=1010, PETRI_TRANSITIONS=1024} [2023-11-29 01:44:00,777 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -52 predicate places. [2023-11-29 01:44:00,777 INFO L495 AbstractCegarLoop]: Abstraction has has 1010 places, 1024 transitions, 2208 flow [2023-11-29 01:44:00,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.0) internal successors, (3276), 3 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:00,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:00,778 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] [2023-11-29 01:44:00,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 01:44:00,778 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:00,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1879370172, now seen corresponding path program 1 times [2023-11-29 01:44:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921435502] [2023-11-29 01:44:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:00,844 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 01:44:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921435502] [2023-11-29 01:44:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921435502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:00,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:00,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:44:00,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164754655] [2023-11-29 01:44:00,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:00,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:00,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:00,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:00,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:00,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1105 out of 1139 [2023-11-29 01:44:00,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1024 transitions, 2208 flow. Second operand has 3 states, 3 states have (on average 1107.3333333333333) internal successors, (3322), 3 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:00,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:00,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1105 of 1139 [2023-11-29 01:44:00,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:02,613 INFO L124 PetriNetUnfolderBase]: 215/4689 cut-off events. [2023-11-29 01:44:02,613 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2023-11-29 01:44:02,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 4689 events. 215/4689 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39341 event pairs, 4 based on Foata normal form. 0/3963 useless extension candidates. Maximal degree in co-relation 4795. Up to 73 conditions per place. [2023-11-29 01:44:02,746 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 16 selfloop transitions, 2 changer transitions 0/1029 dead transitions. [2023-11-29 01:44:02,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 1029 transitions, 2258 flow [2023-11-29 01:44:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3334 transitions. [2023-11-29 01:44:02,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9757096868598185 [2023-11-29 01:44:02,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3334 transitions. [2023-11-29 01:44:02,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3334 transitions. [2023-11-29 01:44:02,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:02,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3334 transitions. [2023-11-29 01:44:02,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1111.3333333333333) internal successors, (3334), 3 states have internal predecessors, (3334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:02,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:02,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:02,755 INFO L175 Difference]: Start difference. First operand has 1010 places, 1024 transitions, 2208 flow. Second operand 3 states and 3334 transitions. [2023-11-29 01:44:02,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 1029 transitions, 2258 flow [2023-11-29 01:44:02,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 1029 transitions, 2250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:44:02,771 INFO L231 Difference]: Finished difference. Result has 998 places, 1025 transitions, 2214 flow [2023-11-29 01:44:02,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2214, PETRI_PLACES=998, PETRI_TRANSITIONS=1025} [2023-11-29 01:44:02,773 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -64 predicate places. [2023-11-29 01:44:02,773 INFO L495 AbstractCegarLoop]: Abstraction has has 998 places, 1025 transitions, 2214 flow [2023-11-29 01:44:02,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1107.3333333333333) internal successors, (3322), 3 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:02,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:02,774 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] [2023-11-29 01:44:02,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 01:44:02,774 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:02,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -762208350, now seen corresponding path program 1 times [2023-11-29 01:44:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:02,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706444480] [2023-11-29 01:44:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:02,845 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 01:44:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706444480] [2023-11-29 01:44:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706444480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:02,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744897787] [2023-11-29 01:44:02,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:02,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:02,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:02,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:02,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1084 out of 1139 [2023-11-29 01:44:02,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1025 transitions, 2214 flow. Second operand has 3 states, 3 states have (on average 1085.6666666666667) internal successors, (3257), 3 states have internal predecessors, (3257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:02,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:02,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1084 of 1139 [2023-11-29 01:44:02,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:06,292 INFO L124 PetriNetUnfolderBase]: 488/9125 cut-off events. [2023-11-29 01:44:06,292 INFO L125 PetriNetUnfolderBase]: For 10/46 co-relation queries the response was YES. [2023-11-29 01:44:06,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9948 conditions, 9125 events. 488/9125 cut-off events. For 10/46 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 84129 event pairs, 14 based on Foata normal form. 2/7731 useless extension candidates. Maximal degree in co-relation 9696. Up to 166 conditions per place. [2023-11-29 01:44:06,482 INFO L140 encePairwiseOnDemand]: 1122/1139 looper letters, 23 selfloop transitions, 9 changer transitions 0/1023 dead transitions. [2023-11-29 01:44:06,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 992 places, 1023 transitions, 2276 flow [2023-11-29 01:44:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3292 transitions. [2023-11-29 01:44:06,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9634182031021363 [2023-11-29 01:44:06,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3292 transitions. [2023-11-29 01:44:06,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3292 transitions. [2023-11-29 01:44:06,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:06,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3292 transitions. [2023-11-29 01:44:06,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:06,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:06,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:06,491 INFO L175 Difference]: Start difference. First operand has 998 places, 1025 transitions, 2214 flow. Second operand 3 states and 3292 transitions. [2023-11-29 01:44:06,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 992 places, 1023 transitions, 2276 flow [2023-11-29 01:44:06,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 1023 transitions, 2274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:44:06,506 INFO L231 Difference]: Finished difference. Result has 993 places, 1021 transitions, 2248 flow [2023-11-29 01:44:06,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2196, PETRI_DIFFERENCE_MINUEND_PLACES=989, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2248, PETRI_PLACES=993, PETRI_TRANSITIONS=1021} [2023-11-29 01:44:06,507 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -69 predicate places. [2023-11-29 01:44:06,508 INFO L495 AbstractCegarLoop]: Abstraction has has 993 places, 1021 transitions, 2248 flow [2023-11-29 01:44:06,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1085.6666666666667) internal successors, (3257), 3 states have internal predecessors, (3257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:06,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:06,509 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 01:44:06,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 01:44:06,509 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:06,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1410126425, now seen corresponding path program 1 times [2023-11-29 01:44:06,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:06,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588802442] [2023-11-29 01:44:06,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:06,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:06,576 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 01:44:06,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:06,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588802442] [2023-11-29 01:44:06,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588802442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:06,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:06,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:06,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228520497] [2023-11-29 01:44:06,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:06,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:06,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:06,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:06,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:06,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1098 out of 1139 [2023-11-29 01:44:06,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 1021 transitions, 2248 flow. Second operand has 3 states, 3 states have (on average 1100.3333333333333) internal successors, (3301), 3 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:06,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:06,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1098 of 1139 [2023-11-29 01:44:06,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:08,449 INFO L124 PetriNetUnfolderBase]: 259/4269 cut-off events. [2023-11-29 01:44:08,449 INFO L125 PetriNetUnfolderBase]: For 206/210 co-relation queries the response was YES. [2023-11-29 01:44:08,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4822 conditions, 4269 events. 259/4269 cut-off events. For 206/210 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 33951 event pairs, 60 based on Foata normal form. 0/3600 useless extension candidates. Maximal degree in co-relation 4569. Up to 212 conditions per place. [2023-11-29 01:44:08,593 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 20 selfloop transitions, 3 changer transitions 0/1022 dead transitions. [2023-11-29 01:44:08,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 1022 transitions, 2298 flow [2023-11-29 01:44:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3314 transitions. [2023-11-29 01:44:08,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9698565993561604 [2023-11-29 01:44:08,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3314 transitions. [2023-11-29 01:44:08,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3314 transitions. [2023-11-29 01:44:08,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:08,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3314 transitions. [2023-11-29 01:44:08,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.6666666666667) internal successors, (3314), 3 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:08,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:08,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:08,599 INFO L175 Difference]: Start difference. First operand has 993 places, 1021 transitions, 2248 flow. Second operand 3 states and 3314 transitions. [2023-11-29 01:44:08,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 1022 transitions, 2298 flow [2023-11-29 01:44:08,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 992 places, 1022 transitions, 2280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:08,610 INFO L231 Difference]: Finished difference. Result has 992 places, 1020 transitions, 2234 flow [2023-11-29 01:44:08,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2234, PETRI_PLACES=992, PETRI_TRANSITIONS=1020} [2023-11-29 01:44:08,612 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -70 predicate places. [2023-11-29 01:44:08,612 INFO L495 AbstractCegarLoop]: Abstraction has has 992 places, 1020 transitions, 2234 flow [2023-11-29 01:44:08,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1100.3333333333333) internal successors, (3301), 3 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:08,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:08,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] [2023-11-29 01:44:08,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 01:44:08,613 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:08,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 849837279, now seen corresponding path program 1 times [2023-11-29 01:44:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757627434] [2023-11-29 01:44:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:08,680 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 01:44:08,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757627434] [2023-11-29 01:44:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757627434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:08,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708612964] [2023-11-29 01:44:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:08,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:08,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:08,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:44:08,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 992 places, 1020 transitions, 2234 flow. Second operand has 3 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:08,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:08,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:44:08,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:11,274 INFO L124 PetriNetUnfolderBase]: 367/7113 cut-off events. [2023-11-29 01:44:11,274 INFO L125 PetriNetUnfolderBase]: For 101/139 co-relation queries the response was YES. [2023-11-29 01:44:11,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7859 conditions, 7113 events. 367/7113 cut-off events. For 101/139 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 68570 event pairs, 48 based on Foata normal form. 2/6049 useless extension candidates. Maximal degree in co-relation 7606. Up to 147 conditions per place. [2023-11-29 01:44:11,542 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 24 selfloop transitions, 3 changer transitions 0/1021 dead transitions. [2023-11-29 01:44:11,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1021 transitions, 2292 flow [2023-11-29 01:44:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3312 transitions. [2023-11-29 01:44:11,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9692712906057945 [2023-11-29 01:44:11,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3312 transitions. [2023-11-29 01:44:11,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3312 transitions. [2023-11-29 01:44:11,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:11,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3312 transitions. [2023-11-29 01:44:11,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.0) internal successors, (3312), 3 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:11,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:11,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:11,551 INFO L175 Difference]: Start difference. First operand has 992 places, 1020 transitions, 2234 flow. Second operand 3 states and 3312 transitions. [2023-11-29 01:44:11,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1021 transitions, 2292 flow [2023-11-29 01:44:11,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 1021 transitions, 2286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:11,562 INFO L231 Difference]: Finished difference. Result has 991 places, 1019 transitions, 2232 flow [2023-11-29 01:44:11,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=989, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2232, PETRI_PLACES=991, PETRI_TRANSITIONS=1019} [2023-11-29 01:44:11,563 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -71 predicate places. [2023-11-29 01:44:11,563 INFO L495 AbstractCegarLoop]: Abstraction has has 991 places, 1019 transitions, 2232 flow [2023-11-29 01:44:11,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:11,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:11,564 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] [2023-11-29 01:44:11,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 01:44:11,564 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:11,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1344143890, now seen corresponding path program 1 times [2023-11-29 01:44:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:11,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657375436] [2023-11-29 01:44:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:11,634 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 01:44:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657375436] [2023-11-29 01:44:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657375436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:44:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714970808] [2023-11-29 01:44:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:11,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:11,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:11,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1105 out of 1139 [2023-11-29 01:44:11,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 1019 transitions, 2232 flow. Second operand has 3 states, 3 states have (on average 1107.6666666666667) internal successors, (3323), 3 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:11,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:11,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1105 of 1139 [2023-11-29 01:44:11,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:15,129 INFO L124 PetriNetUnfolderBase]: 267/5815 cut-off events. [2023-11-29 01:44:15,129 INFO L125 PetriNetUnfolderBase]: For 20/76 co-relation queries the response was YES. [2023-11-29 01:44:15,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6245 conditions, 5815 events. 267/5815 cut-off events. For 20/76 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 51566 event pairs, 10 based on Foata normal form. 0/4920 useless extension candidates. Maximal degree in co-relation 5989. Up to 89 conditions per place. [2023-11-29 01:44:15,557 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 15 selfloop transitions, 2 changer transitions 0/1023 dead transitions. [2023-11-29 01:44:15,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1023 transitions, 2277 flow [2023-11-29 01:44:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3333 transitions. [2023-11-29 01:44:15,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9754170324846356 [2023-11-29 01:44:15,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3333 transitions. [2023-11-29 01:44:15,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3333 transitions. [2023-11-29 01:44:15,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:15,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3333 transitions. [2023-11-29 01:44:15,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1111.0) internal successors, (3333), 3 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:15,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:15,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:15,565 INFO L175 Difference]: Start difference. First operand has 991 places, 1019 transitions, 2232 flow. Second operand 3 states and 3333 transitions. [2023-11-29 01:44:15,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1023 transitions, 2277 flow [2023-11-29 01:44:15,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 1023 transitions, 2271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:15,575 INFO L231 Difference]: Finished difference. Result has 993 places, 1020 transitions, 2240 flow [2023-11-29 01:44:15,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=989, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2240, PETRI_PLACES=993, PETRI_TRANSITIONS=1020} [2023-11-29 01:44:15,576 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -69 predicate places. [2023-11-29 01:44:15,576 INFO L495 AbstractCegarLoop]: Abstraction has has 993 places, 1020 transitions, 2240 flow [2023-11-29 01:44:15,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1107.6666666666667) internal successors, (3323), 3 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:15,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:15,577 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] [2023-11-29 01:44:15,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 01:44:15,577 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:15,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1805818036, now seen corresponding path program 1 times [2023-11-29 01:44:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111180800] [2023-11-29 01:44:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:15,632 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 01:44:15,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:15,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111180800] [2023-11-29 01:44:15,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111180800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:15,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:15,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950289200] [2023-11-29 01:44:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:15,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:15,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1084 out of 1139 [2023-11-29 01:44:15,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 1020 transitions, 2240 flow. Second operand has 3 states, 3 states have (on average 1086.0) internal successors, (3258), 3 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:15,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:15,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1084 of 1139 [2023-11-29 01:44:15,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:21,180 INFO L124 PetriNetUnfolderBase]: 631/11045 cut-off events. [2023-11-29 01:44:21,180 INFO L125 PetriNetUnfolderBase]: For 88/228 co-relation queries the response was YES. [2023-11-29 01:44:21,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12192 conditions, 11045 events. 631/11045 cut-off events. For 88/228 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 115350 event pairs, 67 based on Foata normal form. 0/9380 useless extension candidates. Maximal degree in co-relation 11938. Up to 336 conditions per place. [2023-11-29 01:44:21,846 INFO L140 encePairwiseOnDemand]: 1122/1139 looper letters, 23 selfloop transitions, 9 changer transitions 0/1018 dead transitions. [2023-11-29 01:44:21,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1018 transitions, 2302 flow [2023-11-29 01:44:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3292 transitions. [2023-11-29 01:44:21,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9634182031021363 [2023-11-29 01:44:21,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3292 transitions. [2023-11-29 01:44:21,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3292 transitions. [2023-11-29 01:44:21,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:21,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3292 transitions. [2023-11-29 01:44:21,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:21,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:21,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:21,853 INFO L175 Difference]: Start difference. First operand has 993 places, 1020 transitions, 2240 flow. Second operand 3 states and 3292 transitions. [2023-11-29 01:44:21,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1018 transitions, 2302 flow [2023-11-29 01:44:21,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 1018 transitions, 2300 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:44:21,866 INFO L231 Difference]: Finished difference. Result has 988 places, 1016 transitions, 2274 flow [2023-11-29 01:44:21,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1003, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2274, PETRI_PLACES=988, PETRI_TRANSITIONS=1016} [2023-11-29 01:44:21,867 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -74 predicate places. [2023-11-29 01:44:21,867 INFO L495 AbstractCegarLoop]: Abstraction has has 988 places, 1016 transitions, 2274 flow [2023-11-29 01:44:21,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1086.0) internal successors, (3258), 3 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:21,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:21,868 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 01:44:21,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 01:44:21,868 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:21,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1437291639, now seen corresponding path program 1 times [2023-11-29 01:44:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491604462] [2023-11-29 01:44:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:21,939 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 01:44:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:21,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491604462] [2023-11-29 01:44:21,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491604462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:21,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:21,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032904121] [2023-11-29 01:44:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:21,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:21,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:44:21,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1016 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:21,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:21,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:44:21,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:26,458 INFO L124 PetriNetUnfolderBase]: 484/8855 cut-off events. [2023-11-29 01:44:26,458 INFO L125 PetriNetUnfolderBase]: For 390/620 co-relation queries the response was YES. [2023-11-29 01:44:26,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9990 conditions, 8855 events. 484/8855 cut-off events. For 390/620 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 94302 event pairs, 95 based on Foata normal form. 0/7537 useless extension candidates. Maximal degree in co-relation 9735. Up to 284 conditions per place. [2023-11-29 01:44:26,856 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 24 selfloop transitions, 3 changer transitions 0/1017 dead transitions. [2023-11-29 01:44:26,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 1017 transitions, 2332 flow [2023-11-29 01:44:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3312 transitions. [2023-11-29 01:44:26,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9692712906057945 [2023-11-29 01:44:26,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3312 transitions. [2023-11-29 01:44:26,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3312 transitions. [2023-11-29 01:44:26,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:26,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3312 transitions. [2023-11-29 01:44:26,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.0) internal successors, (3312), 3 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:26,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:26,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:26,862 INFO L175 Difference]: Start difference. First operand has 988 places, 1016 transitions, 2274 flow. Second operand 3 states and 3312 transitions. [2023-11-29 01:44:26,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 1017 transitions, 2332 flow [2023-11-29 01:44:26,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 1017 transitions, 2314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:26,874 INFO L231 Difference]: Finished difference. Result has 987 places, 1015 transitions, 2260 flow [2023-11-29 01:44:26,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1015, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2260, PETRI_PLACES=987, PETRI_TRANSITIONS=1015} [2023-11-29 01:44:26,875 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -75 predicate places. [2023-11-29 01:44:26,875 INFO L495 AbstractCegarLoop]: Abstraction has has 987 places, 1015 transitions, 2260 flow [2023-11-29 01:44:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:26,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:26,876 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] [2023-11-29 01:44:26,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 01:44:26,876 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:26,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1267901683, now seen corresponding path program 1 times [2023-11-29 01:44:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497362627] [2023-11-29 01:44:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,947 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 01:44:26,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:26,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497362627] [2023-11-29 01:44:26,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497362627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:26,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:26,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:26,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601494727] [2023-11-29 01:44:26,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:26,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:26,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1098 out of 1139 [2023-11-29 01:44:26,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1015 transitions, 2260 flow. Second operand has 3 states, 3 states have (on average 1099.6666666666667) internal successors, (3299), 3 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:26,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:26,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1098 of 1139 [2023-11-29 01:44:26,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:29,441 INFO L124 PetriNetUnfolderBase]: 263/5309 cut-off events. [2023-11-29 01:44:29,441 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 01:44:29,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5971 conditions, 5309 events. 263/5309 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 48688 event pairs, 6 based on Foata normal form. 0/4609 useless extension candidates. Maximal degree in co-relation 5716. Up to 106 conditions per place. [2023-11-29 01:44:29,599 INFO L140 encePairwiseOnDemand]: 1132/1139 looper letters, 15 selfloop transitions, 3 changer transitions 0/1013 dead transitions. [2023-11-29 01:44:29,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1013 transitions, 2294 flow [2023-11-29 01:44:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3316 transitions. [2023-11-29 01:44:29,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9704419081065262 [2023-11-29 01:44:29,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3316 transitions. [2023-11-29 01:44:29,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3316 transitions. [2023-11-29 01:44:29,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:29,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3316 transitions. [2023-11-29 01:44:29,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1105.3333333333333) internal successors, (3316), 3 states have internal predecessors, (3316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:29,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:29,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:29,605 INFO L175 Difference]: Start difference. First operand has 987 places, 1015 transitions, 2260 flow. Second operand 3 states and 3316 transitions. [2023-11-29 01:44:29,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1013 transitions, 2294 flow [2023-11-29 01:44:29,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 1013 transitions, 2288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:29,616 INFO L231 Difference]: Finished difference. Result has 983 places, 1011 transitions, 2252 flow [2023-11-29 01:44:29,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2252, PETRI_PLACES=983, PETRI_TRANSITIONS=1011} [2023-11-29 01:44:29,617 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -79 predicate places. [2023-11-29 01:44:29,617 INFO L495 AbstractCegarLoop]: Abstraction has has 983 places, 1011 transitions, 2252 flow [2023-11-29 01:44:29,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1099.6666666666667) internal successors, (3299), 3 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:29,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:29,618 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] [2023-11-29 01:44:29,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 01:44:29,618 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:29,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1390575398, now seen corresponding path program 1 times [2023-11-29 01:44:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697957571] [2023-11-29 01:44:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:29,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:29,670 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 01:44:29,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:29,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697957571] [2023-11-29 01:44:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697957571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:44:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214441880] [2023-11-29 01:44:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:29,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:29,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:29,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:29,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1105 out of 1139 [2023-11-29 01:44:29,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1011 transitions, 2252 flow. Second operand has 3 states, 3 states have (on average 1108.0) internal successors, (3324), 3 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:29,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:29,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1105 of 1139 [2023-11-29 01:44:29,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:33,796 INFO L124 PetriNetUnfolderBase]: 386/8502 cut-off events. [2023-11-29 01:44:33,797 INFO L125 PetriNetUnfolderBase]: For 42/46 co-relation queries the response was YES. [2023-11-29 01:44:34,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9130 conditions, 8502 events. 386/8502 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 76975 event pairs, 16 based on Foata normal form. 0/7174 useless extension candidates. Maximal degree in co-relation 8872. Up to 183 conditions per place. [2023-11-29 01:44:34,212 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 14 selfloop transitions, 2 changer transitions 0/1014 dead transitions. [2023-11-29 01:44:34,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1014 transitions, 2292 flow [2023-11-29 01:44:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3332 transitions. [2023-11-29 01:44:34,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9751243781094527 [2023-11-29 01:44:34,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3332 transitions. [2023-11-29 01:44:34,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3332 transitions. [2023-11-29 01:44:34,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:34,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3332 transitions. [2023-11-29 01:44:34,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1110.6666666666667) internal successors, (3332), 3 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:34,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:34,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:34,220 INFO L175 Difference]: Start difference. First operand has 983 places, 1011 transitions, 2252 flow. Second operand 3 states and 3332 transitions. [2023-11-29 01:44:34,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1014 transitions, 2292 flow [2023-11-29 01:44:34,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 1014 transitions, 2286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:34,231 INFO L231 Difference]: Finished difference. Result has 985 places, 1012 transitions, 2260 flow [2023-11-29 01:44:34,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1009, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2260, PETRI_PLACES=985, PETRI_TRANSITIONS=1012} [2023-11-29 01:44:34,232 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -77 predicate places. [2023-11-29 01:44:34,232 INFO L495 AbstractCegarLoop]: Abstraction has has 985 places, 1012 transitions, 2260 flow [2023-11-29 01:44:34,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1108.0) internal successors, (3324), 3 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:34,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:34,233 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 01:44:34,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 01:44:34,233 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:34,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2034408708, now seen corresponding path program 1 times [2023-11-29 01:44:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:34,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703923940] [2023-11-29 01:44:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:34,285 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 01:44:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:34,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703923940] [2023-11-29 01:44:34,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703923940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:34,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:34,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:34,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543094053] [2023-11-29 01:44:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:34,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:34,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:34,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1084 out of 1139 [2023-11-29 01:44:34,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 985 places, 1012 transitions, 2260 flow. Second operand has 3 states, 3 states have (on average 1086.3333333333333) internal successors, (3259), 3 states have internal predecessors, (3259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:34,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:34,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1084 of 1139 [2023-11-29 01:44:34,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:39,419 INFO L124 PetriNetUnfolderBase]: 690/10453 cut-off events. [2023-11-29 01:44:39,419 INFO L125 PetriNetUnfolderBase]: For 330/334 co-relation queries the response was YES. [2023-11-29 01:44:39,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11985 conditions, 10453 events. 690/10453 cut-off events. For 330/334 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 116251 event pairs, 166 based on Foata normal form. 0/8952 useless extension candidates. Maximal degree in co-relation 11729. Up to 682 conditions per place. [2023-11-29 01:44:39,781 INFO L140 encePairwiseOnDemand]: 1122/1139 looper letters, 23 selfloop transitions, 9 changer transitions 0/1010 dead transitions. [2023-11-29 01:44:39,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1010 transitions, 2322 flow [2023-11-29 01:44:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3292 transitions. [2023-11-29 01:44:39,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9634182031021363 [2023-11-29 01:44:39,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3292 transitions. [2023-11-29 01:44:39,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3292 transitions. [2023-11-29 01:44:39,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:39,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3292 transitions. [2023-11-29 01:44:39,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:39,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:39,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:39,788 INFO L175 Difference]: Start difference. First operand has 985 places, 1012 transitions, 2260 flow. Second operand 3 states and 3292 transitions. [2023-11-29 01:44:39,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1010 transitions, 2322 flow [2023-11-29 01:44:39,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1010 transitions, 2320 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:44:39,799 INFO L231 Difference]: Finished difference. Result has 980 places, 1008 transitions, 2294 flow [2023-11-29 01:44:39,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=980, PETRI_TRANSITIONS=1008} [2023-11-29 01:44:39,800 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -82 predicate places. [2023-11-29 01:44:39,801 INFO L495 AbstractCegarLoop]: Abstraction has has 980 places, 1008 transitions, 2294 flow [2023-11-29 01:44:39,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1086.3333333333333) internal successors, (3259), 3 states have internal predecessors, (3259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:39,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:39,801 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 01:44:39,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 01:44:39,801 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:39,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1645620709, now seen corresponding path program 1 times [2023-11-29 01:44:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:39,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577212433] [2023-11-29 01:44:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:39,853 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 01:44:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:39,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577212433] [2023-11-29 01:44:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577212433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378924931] [2023-11-29 01:44:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:39,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:39,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1139 [2023-11-29 01:44:39,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 1008 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 1098.6666666666667) internal successors, (3296), 3 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:39,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:39,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1139 [2023-11-29 01:44:39,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:44,524 INFO L124 PetriNetUnfolderBase]: 630/10339 cut-off events. [2023-11-29 01:44:44,524 INFO L125 PetriNetUnfolderBase]: For 908/912 co-relation queries the response was YES. [2023-11-29 01:44:44,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12202 conditions, 10339 events. 630/10339 cut-off events. For 908/912 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 111896 event pairs, 190 based on Foata normal form. 0/8863 useless extension candidates. Maximal degree in co-relation 11945. Up to 585 conditions per place. [2023-11-29 01:44:45,032 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 24 selfloop transitions, 3 changer transitions 0/1009 dead transitions. [2023-11-29 01:44:45,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 1009 transitions, 2352 flow [2023-11-29 01:44:45,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3312 transitions. [2023-11-29 01:44:45,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9692712906057945 [2023-11-29 01:44:45,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3312 transitions. [2023-11-29 01:44:45,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3312 transitions. [2023-11-29 01:44:45,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:45,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3312 transitions. [2023-11-29 01:44:45,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.0) internal successors, (3312), 3 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:45,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:45,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:45,040 INFO L175 Difference]: Start difference. First operand has 980 places, 1008 transitions, 2294 flow. Second operand 3 states and 3312 transitions. [2023-11-29 01:44:45,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 1009 transitions, 2352 flow [2023-11-29 01:44:45,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 1009 transitions, 2334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:45,054 INFO L231 Difference]: Finished difference. Result has 979 places, 1007 transitions, 2280 flow [2023-11-29 01:44:45,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1004, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2280, PETRI_PLACES=979, PETRI_TRANSITIONS=1007} [2023-11-29 01:44:45,055 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -83 predicate places. [2023-11-29 01:44:45,055 INFO L495 AbstractCegarLoop]: Abstraction has has 979 places, 1007 transitions, 2280 flow [2023-11-29 01:44:45,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.6666666666667) internal successors, (3296), 3 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:45,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:45,056 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] [2023-11-29 01:44:45,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 01:44:45,056 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:45,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash 278731638, now seen corresponding path program 1 times [2023-11-29 01:44:45,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904333541] [2023-11-29 01:44:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:45,122 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 01:44:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904333541] [2023-11-29 01:44:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904333541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864968277] [2023-11-29 01:44:45,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:45,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:45,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1098 out of 1139 [2023-11-29 01:44:45,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 1007 transitions, 2280 flow. Second operand has 3 states, 3 states have (on average 1100.0) internal successors, (3300), 3 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:45,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:45,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1098 of 1139 [2023-11-29 01:44:45,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:44:50,304 INFO L124 PetriNetUnfolderBase]: 450/8997 cut-off events. [2023-11-29 01:44:50,304 INFO L125 PetriNetUnfolderBase]: For 70/92 co-relation queries the response was YES. [2023-11-29 01:44:50,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10182 conditions, 8997 events. 450/8997 cut-off events. For 70/92 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 93023 event pairs, 39 based on Foata normal form. 0/7836 useless extension candidates. Maximal degree in co-relation 9925. Up to 204 conditions per place. [2023-11-29 01:44:50,643 INFO L140 encePairwiseOnDemand]: 1132/1139 looper letters, 15 selfloop transitions, 3 changer transitions 0/1005 dead transitions. [2023-11-29 01:44:50,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 1005 transitions, 2314 flow [2023-11-29 01:44:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:44:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:44:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3316 transitions. [2023-11-29 01:44:50,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9704419081065262 [2023-11-29 01:44:50,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3316 transitions. [2023-11-29 01:44:50,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3316 transitions. [2023-11-29 01:44:50,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:44:50,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3316 transitions. [2023-11-29 01:44:50,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1105.3333333333333) internal successors, (3316), 3 states have internal predecessors, (3316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:50,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:50,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:50,649 INFO L175 Difference]: Start difference. First operand has 979 places, 1007 transitions, 2280 flow. Second operand 3 states and 3316 transitions. [2023-11-29 01:44:50,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 1005 transitions, 2314 flow [2023-11-29 01:44:50,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 975 places, 1005 transitions, 2308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:44:50,660 INFO L231 Difference]: Finished difference. Result has 975 places, 1003 transitions, 2272 flow [2023-11-29 01:44:50,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2272, PETRI_PLACES=975, PETRI_TRANSITIONS=1003} [2023-11-29 01:44:50,661 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -87 predicate places. [2023-11-29 01:44:50,662 INFO L495 AbstractCegarLoop]: Abstraction has has 975 places, 1003 transitions, 2272 flow [2023-11-29 01:44:50,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1100.0) internal successors, (3300), 3 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:50,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:44:50,662 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 01:44:50,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 01:44:50,662 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:44:50,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 682449979, now seen corresponding path program 1 times [2023-11-29 01:44:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:50,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678526151] [2023-11-29 01:44:50,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:50,726 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 01:44:50,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:50,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678526151] [2023-11-29 01:44:50,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678526151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:50,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:50,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773705052] [2023-11-29 01:44:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:50,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:44:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:44:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:44:50,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1103 out of 1139 [2023-11-29 01:44:50,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 1003 transitions, 2272 flow. Second operand has 3 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:44:50,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:44:50,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1103 of 1139 [2023-11-29 01:44:50,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:45:34,965 INFO L124 PetriNetUnfolderBase]: 7813/111653 cut-off events. [2023-11-29 01:45:34,966 INFO L125 PetriNetUnfolderBase]: For 436/441 co-relation queries the response was YES. [2023-11-29 01:45:37,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125932 conditions, 111653 events. 7813/111653 cut-off events. For 436/441 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 1858599 event pairs, 1056 based on Foata normal form. 1/95230 useless extension candidates. Maximal degree in co-relation 125676. Up to 4858 conditions per place. [2023-11-29 01:45:38,911 INFO L140 encePairwiseOnDemand]: 1133/1139 looper letters, 16 selfloop transitions, 3 changer transitions 0/1007 dead transitions. [2023-11-29 01:45:38,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 1007 transitions, 2322 flow [2023-11-29 01:45:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:45:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:45:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3331 transitions. [2023-11-29 01:45:38,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9748317237342699 [2023-11-29 01:45:38,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3331 transitions. [2023-11-29 01:45:38,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3331 transitions. [2023-11-29 01:45:38,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:45:38,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3331 transitions. [2023-11-29 01:45:38,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1110.3333333333333) internal successors, (3331), 3 states have internal predecessors, (3331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:45:38,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:45:38,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:45:38,922 INFO L175 Difference]: Start difference. First operand has 975 places, 1003 transitions, 2272 flow. Second operand 3 states and 3331 transitions. [2023-11-29 01:45:38,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 1007 transitions, 2322 flow [2023-11-29 01:45:38,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 972 places, 1007 transitions, 2316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:45:38,987 INFO L231 Difference]: Finished difference. Result has 973 places, 1003 transitions, 2281 flow [2023-11-29 01:45:38,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=970, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2281, PETRI_PLACES=973, PETRI_TRANSITIONS=1003} [2023-11-29 01:45:38,988 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -89 predicate places. [2023-11-29 01:45:38,988 INFO L495 AbstractCegarLoop]: Abstraction has has 973 places, 1003 transitions, 2281 flow [2023-11-29 01:45:38,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:45:38,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:45:38,989 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] [2023-11-29 01:45:38,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 01:45:38,989 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:45:38,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:45:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash -363470034, now seen corresponding path program 1 times [2023-11-29 01:45:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:45:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106559181] [2023-11-29 01:45:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:45:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:45:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:45:39,064 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 01:45:39,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:45:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106559181] [2023-11-29 01:45:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106559181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:45:39,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:45:39,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:45:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617343810] [2023-11-29 01:45:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:45:39,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:45:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:45:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:45:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:45:39,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1098 out of 1139 [2023-11-29 01:45:39,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 1003 transitions, 2281 flow. Second operand has 3 states, 3 states have (on average 1100.3333333333333) internal successors, (3301), 3 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:45:39,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:45:39,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1098 of 1139 [2023-11-29 01:45:39,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:45:58,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 659#L97-1true, 2552#(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)), 2603#(= ~name_3~0 ~name_1~0), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2601#true, 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:58,987 INFO L294 olderBase$Statistics]: this new event has 513 ancestors and is cut-off event [2023-11-29 01:45:58,987 INFO L297 olderBase$Statistics]: existing Event has 602 ancestors and is cut-off event [2023-11-29 01:45:58,987 INFO L297 olderBase$Statistics]: existing Event has 513 ancestors and is cut-off event [2023-11-29 01:45:58,987 INFO L297 olderBase$Statistics]: existing Event has 602 ancestors and is cut-off event [2023-11-29 01:45:58,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 642#L106true, 2603#(= ~name_3~0 ~name_1~0), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2601#true, 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:58,987 INFO L294 olderBase$Statistics]: this new event has 513 ancestors and is cut-off event [2023-11-29 01:45:58,987 INFO L297 olderBase$Statistics]: existing Event has 602 ancestors and is cut-off event [2023-11-29 01:45:58,988 INFO L297 olderBase$Statistics]: existing Event has 602 ancestors and is cut-off event [2023-11-29 01:45:58,988 INFO L297 olderBase$Statistics]: existing Event has 513 ancestors and is cut-off event [2023-11-29 01:45:59,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 2603#(= ~name_3~0 ~name_1~0), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, 256#L97-2true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2601#true, 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,028 INFO L294 olderBase$Statistics]: this new event has 514 ancestors and is cut-off event [2023-11-29 01:45:59,028 INFO L297 olderBase$Statistics]: existing Event has 514 ancestors and is cut-off event [2023-11-29 01:45:59,028 INFO L297 olderBase$Statistics]: existing Event has 603 ancestors and is cut-off event [2023-11-29 01:45:59,028 INFO L297 olderBase$Statistics]: existing Event has 603 ancestors and is cut-off event [2023-11-29 01:45:59,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 2603#(= ~name_3~0 ~name_1~0), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2601#true, 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, 576#L106-1true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,029 INFO L294 olderBase$Statistics]: this new event has 514 ancestors and is cut-off event [2023-11-29 01:45:59,029 INFO L297 olderBase$Statistics]: existing Event has 603 ancestors and is cut-off event [2023-11-29 01:45:59,029 INFO L297 olderBase$Statistics]: existing Event has 514 ancestors and is cut-off event [2023-11-29 01:45:59,029 INFO L297 olderBase$Statistics]: existing Event has 603 ancestors and is cut-off event [2023-11-29 01:45:59,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 659#L97-1true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2603#(= ~name_3~0 ~name_1~0), 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,135 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,135 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,135 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,135 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 642#L106true, Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2603#(= ~name_3~0 ~name_1~0), 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,136 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,136 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,136 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,136 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 659#L97-1true, 2552#(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)), 2603#(= ~name_3~0 ~name_1~0), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2601#true, 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,354 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,354 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,354 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,354 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 642#L106true, 2603#(= ~name_3~0 ~name_1~0), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2601#true, 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,355 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,355 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,355 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,355 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 659#L97-1true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 2603#(= ~name_3~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2601#true, Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,362 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,362 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,363 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,363 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 642#L106true, Black: 2583#(= ~name_2~0 ~name_1~0), 2603#(= ~name_3~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2601#true, Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,363 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,363 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is cut-off event [2023-11-29 01:45:59,363 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,363 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is cut-off event [2023-11-29 01:45:59,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, 256#L97-2true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2603#(= ~name_3~0 ~name_1~0), 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,382 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,382 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,382 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,382 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2603#(= ~name_3~0 ~name_1~0), 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, 576#L106-1true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,383 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,383 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,383 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,383 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 2603#(= ~name_3~0 ~name_1~0), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, 256#L97-2true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2601#true, 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,389 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,389 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,389 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,389 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 2603#(= ~name_3~0 ~name_1~0), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2601#true, 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, 576#L106-1true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,390 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,390 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,390 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,390 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 2603#(= ~name_3~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, 256#L97-2true, Black: 2587#true, Black: 1182#true, Black: 2601#true, Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,398 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,398 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,398 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,398 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 2603#(= ~name_3~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2601#true, Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, 576#L106-1true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,399 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,399 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,399 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 01:45:59,399 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 01:45:59,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 659#L97-1true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2603#(= ~name_3~0 ~name_1~0), 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,474 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,474 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,474 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,474 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 642#L106true, Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2603#(= ~name_3~0 ~name_1~0), 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,475 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,475 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,475 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,475 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 659#L97-1true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2603#(= ~name_3~0 ~name_1~0), Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,482 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,482 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,482 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,482 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(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)), 642#L106true, Black: 2583#(= ~name_2~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2603#(= ~name_3~0 ~name_1~0), Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,483 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,483 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,483 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,483 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 659#L97-1true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 2603#(= ~name_3~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2601#true, Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,490 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,490 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,490 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,490 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 642#L106true, 2603#(= ~name_3~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2601#true, Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,491 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,491 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,491 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is cut-off event [2023-11-29 01:45:59,491 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is cut-off event [2023-11-29 01:45:59,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, 256#L97-2true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2603#(= ~name_3~0 ~name_1~0), 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,504 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,504 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,504 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,504 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2581#true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, 2583#(= ~name_2~0 ~name_1~0), Black: 2603#(= ~name_3~0 ~name_1~0), 2556#(= |#race~name_3~0| 0), Black: 1197#(= |#race~result_4~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, 576#L106-1true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,505 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,505 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,505 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,505 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, 256#L97-2true, Black: 2587#true, Black: 1182#true, Black: 2603#(= ~name_3~0 ~name_1~0), Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,510 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,511 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,511 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,511 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2621#true, 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2603#(= ~name_3~0 ~name_1~0), Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2623#(= ~name_3~0 ~name_2~0), Black: 2607#true, 576#L106-1true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,511 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,511 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,511 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,512 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 2603#(= ~name_3~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, 256#L97-2true, Black: 2587#true, Black: 1182#true, Black: 2601#true, Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,518 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,518 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,518 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,518 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 2603#(= ~name_3~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2601#true, Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, 576#L106-1true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,519 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,519 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,519 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 01:45:59,519 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 01:45:59,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 659#L97-1true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2603#(= ~name_3~0 ~name_1~0), Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,576 INFO L294 olderBase$Statistics]: this new event has 525 ancestors and is cut-off event [2023-11-29 01:45:59,576 INFO L297 olderBase$Statistics]: existing Event has 614 ancestors and is cut-off event [2023-11-29 01:45:59,576 INFO L297 olderBase$Statistics]: existing Event has 614 ancestors and is cut-off event [2023-11-29 01:45:59,576 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2023-11-29 01:45:59,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 642#L106true, 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2603#(= ~name_3~0 ~name_1~0), Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,577 INFO L294 olderBase$Statistics]: this new event has 525 ancestors and is cut-off event [2023-11-29 01:45:59,577 INFO L297 olderBase$Statistics]: existing Event has 614 ancestors and is cut-off event [2023-11-29 01:45:59,577 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2023-11-29 01:45:59,577 INFO L297 olderBase$Statistics]: existing Event has 614 ancestors and is cut-off event [2023-11-29 01:45:59,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, 256#L97-2true, Black: 2587#true, Black: 1182#true, Black: 2603#(= ~name_3~0 ~name_1~0), Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,595 INFO L294 olderBase$Statistics]: this new event has 526 ancestors and is cut-off event [2023-11-29 01:45:59,595 INFO L297 olderBase$Statistics]: existing Event has 615 ancestors and is cut-off event [2023-11-29 01:45:59,595 INFO L297 olderBase$Statistics]: existing Event has 615 ancestors and is cut-off event [2023-11-29 01:45:59,595 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2023-11-29 01:45:59,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3350] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= ~name_3~0 ~name_2~0), 2643#(= |#race~nondet_0~0| 0), Black: 2629#(= |#race~break_15~0| 0), Black: 2569#(= |#race~result_8~0| 0), 2648#(= |#race~i_13~0| 0), Black: 2578#(= |#race~result_12~0| 0), Black: 2641#true, 603#L138-7true, 2552#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 2583#(= ~name_2~0 ~name_1~0), 1184#(= |#race~name_2~0| 0), Black: 1177#true, Black: 2587#true, Black: 1182#true, Black: 2603#(= ~name_3~0 ~name_1~0), Black: 1197#(= |#race~result_4~0| 0), 2556#(= |#race~name_3~0| 0), Black: 2536#(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: 2542#(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: 2528#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2607#true, 576#L106-1true, Black: 1208#(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)), 1179#(= |#race~name_1~0| 0), Black: 2554#true]) [2023-11-29 01:45:59,596 INFO L294 olderBase$Statistics]: this new event has 526 ancestors and is cut-off event [2023-11-29 01:45:59,596 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2023-11-29 01:45:59,596 INFO L297 olderBase$Statistics]: existing Event has 615 ancestors and is cut-off event [2023-11-29 01:45:59,596 INFO L297 olderBase$Statistics]: existing Event has 615 ancestors and is cut-off event [2023-11-29 01:45:59,820 INFO L124 PetriNetUnfolderBase]: 3076/42271 cut-off events. [2023-11-29 01:45:59,820 INFO L125 PetriNetUnfolderBase]: For 750/982 co-relation queries the response was YES. [2023-11-29 01:46:01,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48689 conditions, 42271 events. 3076/42271 cut-off events. For 750/982 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 607892 event pairs, 108 based on Foata normal form. 4/36394 useless extension candidates. Maximal degree in co-relation 48432. Up to 1612 conditions per place. [2023-11-29 01:46:01,704 INFO L140 encePairwiseOnDemand]: 1132/1139 looper letters, 15 selfloop transitions, 3 changer transitions 0/1001 dead transitions. [2023-11-29 01:46:01,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 1001 transitions, 2315 flow [2023-11-29 01:46:01,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:46:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:46:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3316 transitions. [2023-11-29 01:46:01,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9704419081065262 [2023-11-29 01:46:01,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3316 transitions. [2023-11-29 01:46:01,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3316 transitions. [2023-11-29 01:46:01,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:46:01,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3316 transitions. [2023-11-29 01:46:01,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1105.3333333333333) internal successors, (3316), 3 states have internal predecessors, (3316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:01,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:01,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:01,710 INFO L175 Difference]: Start difference. First operand has 973 places, 1003 transitions, 2281 flow. Second operand 3 states and 3316 transitions. [2023-11-29 01:46:01,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 971 places, 1001 transitions, 2315 flow [2023-11-29 01:46:01,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 1001 transitions, 2315 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:46:01,726 INFO L231 Difference]: Finished difference. Result has 971 places, 999 transitions, 2279 flow [2023-11-29 01:46:01,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2279, PETRI_PLACES=971, PETRI_TRANSITIONS=999} [2023-11-29 01:46:01,727 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -91 predicate places. [2023-11-29 01:46:01,728 INFO L495 AbstractCegarLoop]: Abstraction has has 971 places, 999 transitions, 2279 flow [2023-11-29 01:46:01,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1100.3333333333333) internal successors, (3301), 3 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:01,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:46:01,728 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 01:46:01,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-29 01:46:01,728 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:46:01,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:46:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 983515779, now seen corresponding path program 1 times [2023-11-29 01:46:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:46:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164504025] [2023-11-29 01:46:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:46:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:46:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:01,796 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 01:46:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:46:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164504025] [2023-11-29 01:46:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164504025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:46:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:46:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:46:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403679638] [2023-11-29 01:46:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:46:01,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:46:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:46:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:46:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:46:01,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1099 out of 1139 [2023-11-29 01:46:01,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 999 transitions, 2279 flow. Second operand has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:01,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:46:01,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1099 of 1139 [2023-11-29 01:46:01,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:46:54,459 INFO L124 PetriNetUnfolderBase]: 6330/124282 cut-off events. [2023-11-29 01:46:54,459 INFO L125 PetriNetUnfolderBase]: For 107/183 co-relation queries the response was YES. [2023-11-29 01:46:58,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138516 conditions, 124282 events. 6330/124282 cut-off events. For 107/183 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 2061215 event pairs, 318 based on Foata normal form. 12/108377 useless extension candidates. Maximal degree in co-relation 138258. Up to 2272 conditions per place. [2023-11-29 01:46:59,292 INFO L140 encePairwiseOnDemand]: 1136/1139 looper letters, 20 selfloop transitions, 3 changer transitions 0/1000 dead transitions. [2023-11-29 01:46:59,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 1000 transitions, 2329 flow [2023-11-29 01:46:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:46:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:46:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3317 transitions. [2023-11-29 01:46:59,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9707345624817091 [2023-11-29 01:46:59,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3317 transitions. [2023-11-29 01:46:59,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3317 transitions. [2023-11-29 01:46:59,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:46:59,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3317 transitions. [2023-11-29 01:46:59,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1105.6666666666667) internal successors, (3317), 3 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:59,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:59,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1139.0) internal successors, (4556), 4 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:59,298 INFO L175 Difference]: Start difference. First operand has 971 places, 999 transitions, 2279 flow. Second operand 3 states and 3317 transitions. [2023-11-29 01:46:59,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 1000 transitions, 2329 flow [2023-11-29 01:46:59,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 1000 transitions, 2323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:46:59,346 INFO L231 Difference]: Finished difference. Result has 970 places, 998 transitions, 2277 flow [2023-11-29 01:46:59,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2277, PETRI_PLACES=970, PETRI_TRANSITIONS=998} [2023-11-29 01:46:59,348 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -92 predicate places. [2023-11-29 01:46:59,348 INFO L495 AbstractCegarLoop]: Abstraction has has 970 places, 998 transitions, 2277 flow [2023-11-29 01:46:59,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:59,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:46:59,349 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 01:46:59,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-29 01:46:59,349 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:46:59,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:46:59,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1562467828, now seen corresponding path program 1 times [2023-11-29 01:46:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:46:59,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127135506] [2023-11-29 01:46:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:46:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:46:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,496 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 01:46:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:46:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127135506] [2023-11-29 01:46:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127135506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:46:59,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:46:59,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:46:59,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384135163] [2023-11-29 01:46:59,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:46:59,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:46:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:46:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:46:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:46:59,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1104 out of 1139 [2023-11-29 01:46:59,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 998 transitions, 2277 flow. Second operand has 4 states, 4 states have (on average 1105.75) internal successors, (4423), 4 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:46:59,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:46:59,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1104 of 1139 [2023-11-29 01:46:59,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:47:32,382 INFO L124 PetriNetUnfolderBase]: 4038/72962 cut-off events. [2023-11-29 01:47:32,382 INFO L125 PetriNetUnfolderBase]: For 52/182 co-relation queries the response was YES. [2023-11-29 01:47:34,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81031 conditions, 72962 events. 4038/72962 cut-off events. For 52/182 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 1069706 event pairs, 306 based on Foata normal form. 10/63199 useless extension candidates. Maximal degree in co-relation 80772. Up to 1574 conditions per place. [2023-11-29 01:47:35,860 INFO L140 encePairwiseOnDemand]: 1131/1139 looper letters, 19 selfloop transitions, 8 changer transitions 0/1011 dead transitions. [2023-11-29 01:47:35,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 1011 transitions, 2365 flow [2023-11-29 01:47:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:47:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:47:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5548 transitions. [2023-11-29 01:47:35,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9741878841088675 [2023-11-29 01:47:35,865 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 5548 transitions. [2023-11-29 01:47:35,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5548 transitions. [2023-11-29 01:47:35,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:47:35,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 5548 transitions. [2023-11-29 01:47:35,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1109.6) internal successors, (5548), 5 states have internal predecessors, (5548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:47:35,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1139.0) internal successors, (6834), 6 states have internal predecessors, (6834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:47:35,871 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1139.0) internal successors, (6834), 6 states have internal predecessors, (6834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:47:35,872 INFO L175 Difference]: Start difference. First operand has 970 places, 998 transitions, 2277 flow. Second operand 5 states and 5548 transitions. [2023-11-29 01:47:35,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 1011 transitions, 2365 flow [2023-11-29 01:47:35,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 972 places, 1011 transitions, 2359 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:47:35,897 INFO L231 Difference]: Finished difference. Result has 975 places, 1002 transitions, 2317 flow [2023-11-29 01:47:35,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2317, PETRI_PLACES=975, PETRI_TRANSITIONS=1002} [2023-11-29 01:47:35,898 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -87 predicate places. [2023-11-29 01:47:35,898 INFO L495 AbstractCegarLoop]: Abstraction has has 975 places, 1002 transitions, 2317 flow [2023-11-29 01:47:35,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1105.75) internal successors, (4423), 4 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:47:35,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:47:35,899 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] [2023-11-29 01:47:35,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-11-29 01:47:35,899 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:47:35,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1280182346, now seen corresponding path program 1 times [2023-11-29 01:47:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121432360] [2023-11-29 01:47:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:36,491 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 01:47:36,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:36,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121432360] [2023-11-29 01:47:36,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121432360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:47:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377579732] [2023-11-29 01:47:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:36,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:47:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:36,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:47:36,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:47:36,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1097 out of 1139 [2023-11-29 01:47:36,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 1002 transitions, 2317 flow. Second operand has 6 states, 6 states have (on average 1099.5) internal successors, (6597), 6 states have internal predecessors, (6597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:47:36,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:47:36,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1097 of 1139 [2023-11-29 01:47:36,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:47:59,295 INFO L124 PetriNetUnfolderBase]: 2513/44543 cut-off events. [2023-11-29 01:47:59,295 INFO L125 PetriNetUnfolderBase]: For 89/181 co-relation queries the response was YES. [2023-11-29 01:48:00,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49623 conditions, 44543 events. 2513/44543 cut-off events. For 89/181 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 590804 event pairs, 230 based on Foata normal form. 48/38633 useless extension candidates. Maximal degree in co-relation 49345. Up to 1042 conditions per place. [2023-11-29 01:48:01,361 INFO L140 encePairwiseOnDemand]: 1133/1139 looper letters, 23 selfloop transitions, 6 changer transitions 0/1009 dead transitions. [2023-11-29 01:48:01,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1009 transitions, 2397 flow [2023-11-29 01:48:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:48:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:48:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6611 transitions. [2023-11-29 01:48:01,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9673690371671056 [2023-11-29 01:48:01,364 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 6611 transitions. [2023-11-29 01:48:01,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6611 transitions. [2023-11-29 01:48:01,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:48:01,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 6611 transitions. [2023-11-29 01:48:01,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1101.8333333333333) internal successors, (6611), 6 states have internal predecessors, (6611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:01,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1139.0) internal successors, (7973), 7 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:01,372 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1139.0) internal successors, (7973), 7 states have internal predecessors, (7973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:01,372 INFO L175 Difference]: Start difference. First operand has 975 places, 1002 transitions, 2317 flow. Second operand 6 states and 6611 transitions. [2023-11-29 01:48:01,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1009 transitions, 2397 flow [2023-11-29 01:48:01,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 1009 transitions, 2397 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:48:01,398 INFO L231 Difference]: Finished difference. Result has 979 places, 1001 transitions, 2327 flow [2023-11-29 01:48:01,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2315, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1001, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2327, PETRI_PLACES=979, PETRI_TRANSITIONS=1001} [2023-11-29 01:48:01,399 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -83 predicate places. [2023-11-29 01:48:01,399 INFO L495 AbstractCegarLoop]: Abstraction has has 979 places, 1001 transitions, 2327 flow [2023-11-29 01:48:01,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1099.5) internal successors, (6597), 6 states have internal predecessors, (6597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:01,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:48:01,401 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 01:48:01,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-11-29 01:48:01,401 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:48:01,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:01,401 INFO L85 PathProgramCache]: Analyzing trace with hash 692089014, now seen corresponding path program 1 times [2023-11-29 01:48:01,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:01,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724199298] [2023-11-29 01:48:01,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:01,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,504 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 01:48:01,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:01,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724199298] [2023-11-29 01:48:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724199298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:01,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:48:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:48:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087072895] [2023-11-29 01:48:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:01,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:48:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:48:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:48:01,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1104 out of 1139 [2023-11-29 01:48:01,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 1001 transitions, 2327 flow. Second operand has 4 states, 4 states have (on average 1106.0) internal successors, (4424), 4 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:01,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:48:01,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1104 of 1139 [2023-11-29 01:48:01,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:48:41,304 INFO L124 PetriNetUnfolderBase]: 4344/78131 cut-off events. [2023-11-29 01:48:41,304 INFO L125 PetriNetUnfolderBase]: For 197/236 co-relation queries the response was YES. [2023-11-29 01:48:44,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87061 conditions, 78131 events. 4344/78131 cut-off events. For 197/236 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 1135884 event pairs, 640 based on Foata normal form. 1/67767 useless extension candidates. Maximal degree in co-relation 86795. Up to 1487 conditions per place. [2023-11-29 01:48:45,216 INFO L140 encePairwiseOnDemand]: 1131/1139 looper letters, 18 selfloop transitions, 8 changer transitions 0/1013 dead transitions. [2023-11-29 01:48:45,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1013 transitions, 2410 flow [2023-11-29 01:48:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:48:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:48:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5547 transitions. [2023-11-29 01:48:45,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9740122914837577 [2023-11-29 01:48:45,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 5547 transitions. [2023-11-29 01:48:45,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5547 transitions. [2023-11-29 01:48:45,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:48:45,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 5547 transitions. [2023-11-29 01:48:45,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1109.4) internal successors, (5547), 5 states have internal predecessors, (5547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:45,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1139.0) internal successors, (6834), 6 states have internal predecessors, (6834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:45,226 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1139.0) internal successors, (6834), 6 states have internal predecessors, (6834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:45,226 INFO L175 Difference]: Start difference. First operand has 979 places, 1001 transitions, 2327 flow. Second operand 5 states and 5547 transitions. [2023-11-29 01:48:45,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1013 transitions, 2410 flow [2023-11-29 01:48:45,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1013 transitions, 2398 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:48:45,257 INFO L231 Difference]: Finished difference. Result has 981 places, 1005 transitions, 2361 flow [2023-11-29 01:48:45,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1139, PETRI_DIFFERENCE_MINUEND_FLOW=2315, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1001, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=994, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2361, PETRI_PLACES=981, PETRI_TRANSITIONS=1005} [2023-11-29 01:48:45,259 INFO L281 CegarLoopForPetriNet]: 1062 programPoint places, -81 predicate places. [2023-11-29 01:48:45,259 INFO L495 AbstractCegarLoop]: Abstraction has has 981 places, 1005 transitions, 2361 flow [2023-11-29 01:48:45,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1106.0) internal successors, (4424), 4 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:45,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:48:45,260 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 01:48:45,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-11-29 01:48:45,260 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 282 more)] === [2023-11-29 01:48:45,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1056894675, now seen corresponding path program 1 times [2023-11-29 01:48:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:45,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059172250] [2023-11-29 01:48:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:45,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,330 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 01:48:45,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:45,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059172250] [2023-11-29 01:48:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059172250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:45,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:48:45,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:48:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312320614] [2023-11-29 01:48:45,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:45,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:48:45,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:48:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:48:45,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1098 out of 1139 [2023-11-29 01:48:45,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 1005 transitions, 2361 flow. Second operand has 3 states, 3 states have (on average 1100.6666666666667) internal successors, (3302), 3 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:48:45,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:48:45,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1098 of 1139 [2023-11-29 01:48:45,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand