./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:53:32,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:32,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:32,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:32,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:32,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:32,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:32,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:32,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:32,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:32,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:32,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:32,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:32,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:32,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:32,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:32,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:32,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:32,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:32,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:32,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:32,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:32,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:32,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:32,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:32,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:32,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:32,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:32,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:32,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:32,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:32,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:32,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:32,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:32,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:32,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:32,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:32,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:32,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:32,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:32,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:32,464 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:53:32,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:32,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:32,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:32,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:32,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:32,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:32,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:32,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:32,510 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:32,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:32,511 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:32,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:53:32,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:32,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:32,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:32,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:32,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:32,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:32,514 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:53:32,514 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:32,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:32,515 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:32,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:32,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:32,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:32,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:32,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:32,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:32,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:32,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:32,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:32,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:32,518 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:32,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:32,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:32,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/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_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 [2022-11-02 20:53:32,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:32,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:32,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:32,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:32,889 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:32,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-11-02 20:53:32,985 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/data/764833234/1d80997ac5d94210a8e20a19258f957f/FLAG0390c8852 [2022-11-02 20:53:33,507 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:33,508 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-11-02 20:53:33,516 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/data/764833234/1d80997ac5d94210a8e20a19258f957f/FLAG0390c8852 [2022-11-02 20:53:33,883 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/data/764833234/1d80997ac5d94210a8e20a19258f957f [2022-11-02 20:53:33,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:33,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:33,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:33,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:33,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:33,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:33" (1/1) ... [2022-11-02 20:53:33,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba86de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:33, skipping insertion in model container [2022-11-02 20:53:33,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:33" (1/1) ... [2022-11-02 20:53:33,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:33,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:34,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-11-02 20:53:34,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:34,285 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:34,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-11-02 20:53:34,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:34,344 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:34,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34 WrapperNode [2022-11-02 20:53:34,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:34,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:34,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:34,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:34,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,413 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 271 [2022-11-02 20:53:34,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:34,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:34,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:34,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:34,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,452 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:34,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:34,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:34,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:34,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (1/1) ... [2022-11-02 20:53:34,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:34,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:34,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:53:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:53:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:53:34,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:53:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:53:34,585 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:53:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:53:34,585 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:53:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:53:34,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:53:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-11-02 20:53:34,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-11-02 20:53:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-11-02 20:53:34,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-11-02 20:53:34,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:34,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:34,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:34,589 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:53:34,707 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:34,709 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:35,538 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:35,559 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:35,561 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:53:35,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:35 BoogieIcfgContainer [2022-11-02 20:53:35,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:35,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:35,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:35,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:35,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:33" (1/3) ... [2022-11-02 20:53:35,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e1fb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:35, skipping insertion in model container [2022-11-02 20:53:35,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:34" (2/3) ... [2022-11-02 20:53:35,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e1fb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:35, skipping insertion in model container [2022-11-02 20:53:35,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:35" (3/3) ... [2022-11-02 20:53:35,575 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-11-02 20:53:35,584 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:53:35,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:35,596 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-11-02 20:53:35,596 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:53:35,748 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-11-02 20:53:35,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 463 transitions, 974 flow [2022-11-02 20:53:36,034 INFO L130 PetriNetUnfolder]: 24/457 cut-off events. [2022-11-02 20:53:36,034 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:53:36,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 24/457 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 798 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 285. Up to 2 conditions per place. [2022-11-02 20:53:36,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 458 places, 463 transitions, 974 flow [2022-11-02 20:53:36,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 418 places, 421 transitions, 878 flow [2022-11-02 20:53:36,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:36,092 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=LoopsAndPotentialCycles, 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;@49aff53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:36,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2022-11-02 20:53:36,104 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-11-02 20:53:36,105 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:53:36,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:36,106 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] [2022-11-02 20:53:36,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1336015694, now seen corresponding path program 1 times [2022-11-02 20:53:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:36,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387657606] [2022-11-02 20:53:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387657606] [2022-11-02 20:53:36,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387657606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:36,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:36,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630889610] [2022-11-02 20:53:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:36,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:36,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:36,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:36,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:36,490 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-02 20:53:36,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 421 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:36,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:36,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-02 20:53:36,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:36,832 INFO L130 PetriNetUnfolder]: 80/583 cut-off events. [2022-11-02 20:53:36,832 INFO L131 PetriNetUnfolder]: For 84/91 co-relation queries the response was YES. [2022-11-02 20:53:36,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 583 events. 80/583 cut-off events. For 84/91 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2281 event pairs, 60 based on Foata normal form. 211/668 useless extension candidates. Maximal degree in co-relation 614. Up to 157 conditions per place. [2022-11-02 20:53:36,852 INFO L137 encePairwiseOnDemand]: 453/463 looper letters, 36 selfloop transitions, 2 changer transitions 1/413 dead transitions. [2022-11-02 20:53:36,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 413 transitions, 938 flow [2022-11-02 20:53:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2022-11-02 20:53:36,879 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9294456443484521 [2022-11-02 20:53:36,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1291 transitions. [2022-11-02 20:53:36,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1291 transitions. [2022-11-02 20:53:36,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:36,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1291 transitions. [2022-11-02 20:53:36,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:36,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:36,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:36,911 INFO L175 Difference]: Start difference. First operand has 418 places, 421 transitions, 878 flow. Second operand 3 states and 1291 transitions. [2022-11-02 20:53:36,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 413 transitions, 938 flow [2022-11-02 20:53:36,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 413 transitions, 914 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-11-02 20:53:36,940 INFO L231 Difference]: Finished difference. Result has 407 places, 412 transitions, 840 flow [2022-11-02 20:53:36,943 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=407, PETRI_TRANSITIONS=412} [2022-11-02 20:53:36,948 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -11 predicate places. [2022-11-02 20:53:36,949 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 412 transitions, 840 flow [2022-11-02 20:53:36,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:36,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:36,951 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] [2022-11-02 20:53:36,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:53:36,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:36,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1730917584, now seen corresponding path program 1 times [2022-11-02 20:53:36,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:36,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752191046] [2022-11-02 20:53:36,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:37,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:37,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752191046] [2022-11-02 20:53:37,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752191046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:37,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:37,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323451485] [2022-11-02 20:53:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:37,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:37,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:37,093 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-02 20:53:37,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 412 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:37,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-02 20:53:37,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:37,346 INFO L130 PetriNetUnfolder]: 80/581 cut-off events. [2022-11-02 20:53:37,346 INFO L131 PetriNetUnfolder]: For 18/24 co-relation queries the response was YES. [2022-11-02 20:53:37,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 581 events. 80/581 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2226 event pairs, 60 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 761. Up to 157 conditions per place. [2022-11-02 20:53:37,362 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2022-11-02 20:53:37,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 914 flow [2022-11-02 20:53:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-02 20:53:37,366 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-02 20:53:37,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-02 20:53:37,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-02 20:53:37,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:37,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-02 20:53:37,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,376 INFO L175 Difference]: Start difference. First operand has 407 places, 412 transitions, 840 flow. Second operand 3 states and 1284 transitions. [2022-11-02 20:53:37,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 914 flow [2022-11-02 20:53:37,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 411 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:37,386 INFO L231 Difference]: Finished difference. Result has 405 places, 411 transitions, 838 flow [2022-11-02 20:53:37,387 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=405, PETRI_TRANSITIONS=411} [2022-11-02 20:53:37,388 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -13 predicate places. [2022-11-02 20:53:37,388 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 411 transitions, 838 flow [2022-11-02 20:53:37,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:37,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:37,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:53:37,390 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash 740256022, now seen corresponding path program 1 times [2022-11-02 20:53:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:37,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101396045] [2022-11-02 20:53:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:37,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:37,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101396045] [2022-11-02 20:53:37,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101396045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:37,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:37,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405401323] [2022-11-02 20:53:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:37,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:37,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:37,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:37,453 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-02 20:53:37,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 411 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:37,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-02 20:53:37,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:37,675 INFO L130 PetriNetUnfolder]: 80/580 cut-off events. [2022-11-02 20:53:37,675 INFO L131 PetriNetUnfolder]: For 30/36 co-relation queries the response was YES. [2022-11-02 20:53:37,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 580 events. 80/580 cut-off events. For 30/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2211 event pairs, 60 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 742. Up to 157 conditions per place. [2022-11-02 20:53:37,691 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2022-11-02 20:53:37,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 410 transitions, 912 flow [2022-11-02 20:53:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-02 20:53:37,695 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-02 20:53:37,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-02 20:53:37,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-02 20:53:37,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:37,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-02 20:53:37,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,704 INFO L175 Difference]: Start difference. First operand has 405 places, 411 transitions, 838 flow. Second operand 3 states and 1284 transitions. [2022-11-02 20:53:37,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 410 transitions, 912 flow [2022-11-02 20:53:37,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:37,714 INFO L231 Difference]: Finished difference. Result has 404 places, 410 transitions, 836 flow [2022-11-02 20:53:37,715 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=404, PETRI_TRANSITIONS=410} [2022-11-02 20:53:37,716 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -14 predicate places. [2022-11-02 20:53:37,716 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 410 transitions, 836 flow [2022-11-02 20:53:37,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:37,718 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] [2022-11-02 20:53:37,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:53:37,718 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1949606868, now seen corresponding path program 1 times [2022-11-02 20:53:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:37,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356675607] [2022-11-02 20:53:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:37,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:37,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356675607] [2022-11-02 20:53:37,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356675607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:37,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:37,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563647935] [2022-11-02 20:53:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:37,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:37,776 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-02 20:53:37,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 410 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:37,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-02 20:53:37,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:38,037 INFO L130 PetriNetUnfolder]: 80/579 cut-off events. [2022-11-02 20:53:38,038 INFO L131 PetriNetUnfolder]: For 42/48 co-relation queries the response was YES. [2022-11-02 20:53:38,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 579 events. 80/579 cut-off events. For 42/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2187 event pairs, 60 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 723. Up to 157 conditions per place. [2022-11-02 20:53:38,051 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2022-11-02 20:53:38,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 409 transitions, 910 flow [2022-11-02 20:53:38,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-02 20:53:38,060 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-02 20:53:38,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-02 20:53:38,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-02 20:53:38,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:38,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-02 20:53:38,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,076 INFO L175 Difference]: Start difference. First operand has 404 places, 410 transitions, 836 flow. Second operand 3 states and 1284 transitions. [2022-11-02 20:53:38,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 409 transitions, 910 flow [2022-11-02 20:53:38,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 409 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:38,087 INFO L231 Difference]: Finished difference. Result has 403 places, 409 transitions, 834 flow [2022-11-02 20:53:38,088 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=403, PETRI_TRANSITIONS=409} [2022-11-02 20:53:38,089 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -15 predicate places. [2022-11-02 20:53:38,090 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 409 transitions, 834 flow [2022-11-02 20:53:38,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:38,092 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] [2022-11-02 20:53:38,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:53:38,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:38,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1482091646, now seen corresponding path program 1 times [2022-11-02 20:53:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:38,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362111445] [2022-11-02 20:53:38,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:38,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:38,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362111445] [2022-11-02 20:53:38,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362111445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:38,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:38,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649505803] [2022-11-02 20:53:38,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:38,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:38,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:38,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:38,189 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-02 20:53:38,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 409 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:38,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-02 20:53:38,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:38,403 INFO L130 PetriNetUnfolder]: 80/578 cut-off events. [2022-11-02 20:53:38,403 INFO L131 PetriNetUnfolder]: For 54/60 co-relation queries the response was YES. [2022-11-02 20:53:38,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 578 events. 80/578 cut-off events. For 54/60 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2133 event pairs, 60 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 704. Up to 157 conditions per place. [2022-11-02 20:53:38,417 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2022-11-02 20:53:38,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 408 transitions, 908 flow [2022-11-02 20:53:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-02 20:53:38,421 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-02 20:53:38,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-02 20:53:38,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-02 20:53:38,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:38,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-02 20:53:38,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,430 INFO L175 Difference]: Start difference. First operand has 403 places, 409 transitions, 834 flow. Second operand 3 states and 1284 transitions. [2022-11-02 20:53:38,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 408 transitions, 908 flow [2022-11-02 20:53:38,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 408 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:38,439 INFO L231 Difference]: Finished difference. Result has 402 places, 408 transitions, 832 flow [2022-11-02 20:53:38,440 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=402, PETRI_TRANSITIONS=408} [2022-11-02 20:53:38,444 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -16 predicate places. [2022-11-02 20:53:38,445 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 408 transitions, 832 flow [2022-11-02 20:53:38,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:38,447 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] [2022-11-02 20:53:38,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:53:38,448 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:38,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1485355233, now seen corresponding path program 1 times [2022-11-02 20:53:38,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:38,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501293472] [2022-11-02 20:53:38,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:38,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501293472] [2022-11-02 20:53:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501293472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:38,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:38,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933961051] [2022-11-02 20:53:38,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:38,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:38,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:38,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:38,555 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-02 20:53:38,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:38,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-02 20:53:38,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:38,752 INFO L130 PetriNetUnfolder]: 80/577 cut-off events. [2022-11-02 20:53:38,753 INFO L131 PetriNetUnfolder]: For 66/72 co-relation queries the response was YES. [2022-11-02 20:53:38,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 577 events. 80/577 cut-off events. For 66/72 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2157 event pairs, 60 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 684. Up to 156 conditions per place. [2022-11-02 20:53:38,771 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 35 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2022-11-02 20:53:38,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 407 transitions, 904 flow [2022-11-02 20:53:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2022-11-02 20:53:38,775 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9236861051115911 [2022-11-02 20:53:38,776 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2022-11-02 20:53:38,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2022-11-02 20:53:38,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:38,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2022-11-02 20:53:38,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,786 INFO L175 Difference]: Start difference. First operand has 402 places, 408 transitions, 832 flow. Second operand 3 states and 1283 transitions. [2022-11-02 20:53:38,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 407 transitions, 904 flow [2022-11-02 20:53:38,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 407 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:38,795 INFO L231 Difference]: Finished difference. Result has 401 places, 407 transitions, 830 flow [2022-11-02 20:53:38,796 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=401, PETRI_TRANSITIONS=407} [2022-11-02 20:53:38,799 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -17 predicate places. [2022-11-02 20:53:38,799 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 407 transitions, 830 flow [2022-11-02 20:53:38,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:38,801 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] [2022-11-02 20:53:38,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:53:38,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1143953655, now seen corresponding path program 1 times [2022-11-02 20:53:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:38,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202721759] [2022-11-02 20:53:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:38,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202721759] [2022-11-02 20:53:38,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202721759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:38,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:38,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655487877] [2022-11-02 20:53:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:38,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:38,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:38,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:38,882 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-02 20:53:38,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 407 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:38,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:38,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-02 20:53:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:55,162 INFO L130 PetriNetUnfolder]: 26740/76416 cut-off events. [2022-11-02 20:53:55,162 INFO L131 PetriNetUnfolder]: For 1365/1736 co-relation queries the response was YES. [2022-11-02 20:53:55,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108529 conditions, 76416 events. 26740/76416 cut-off events. For 1365/1736 co-relation queries the response was YES. Maximal size of possible extension queue 3869. Compared 1070526 event pairs, 23895 based on Foata normal form. 0/55614 useless extension candidates. Maximal degree in co-relation 108462. Up to 30742 conditions per place. [2022-11-02 20:53:56,964 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 51 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2022-11-02 20:53:56,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 406 transitions, 934 flow [2022-11-02 20:53:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2022-11-02 20:53:56,970 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9028077753779697 [2022-11-02 20:53:56,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1254 transitions. [2022-11-02 20:53:56,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1254 transitions. [2022-11-02 20:53:56,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:56,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1254 transitions. [2022-11-02 20:53:56,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:56,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:56,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:56,981 INFO L175 Difference]: Start difference. First operand has 401 places, 407 transitions, 830 flow. Second operand 3 states and 1254 transitions. [2022-11-02 20:53:56,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 406 transitions, 934 flow [2022-11-02 20:53:56,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 406 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:56,991 INFO L231 Difference]: Finished difference. Result has 400 places, 406 transitions, 828 flow [2022-11-02 20:53:56,992 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=400, PETRI_TRANSITIONS=406} [2022-11-02 20:53:56,993 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -18 predicate places. [2022-11-02 20:53:56,993 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 406 transitions, 828 flow [2022-11-02 20:53:56,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:56,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:56,994 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] [2022-11-02 20:53:56,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:53:56,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:56,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2022394243, now seen corresponding path program 1 times [2022-11-02 20:53:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:56,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4911712] [2022-11-02 20:53:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:56,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:57,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4911712] [2022-11-02 20:53:57,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4911712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:57,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:57,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402517752] [2022-11-02 20:53:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:57,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:57,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:57,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:57,086 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-02 20:53:57,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 406 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:57,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-02 20:53:57,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:57,268 INFO L130 PetriNetUnfolder]: 65/546 cut-off events. [2022-11-02 20:53:57,268 INFO L131 PetriNetUnfolder]: For 6/11 co-relation queries the response was YES. [2022-11-02 20:53:57,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 546 events. 65/546 cut-off events. For 6/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1907 event pairs, 30 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 653. Up to 90 conditions per place. [2022-11-02 20:53:57,280 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 32 selfloop transitions, 3 changer transitions 0/406 dead transitions. [2022-11-02 20:53:57,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 406 transitions, 903 flow [2022-11-02 20:53:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-11-02 20:53:57,288 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9323254139668826 [2022-11-02 20:53:57,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-11-02 20:53:57,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-11-02 20:53:57,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:57,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-11-02 20:53:57,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,297 INFO L175 Difference]: Start difference. First operand has 400 places, 406 transitions, 828 flow. Second operand 3 states and 1295 transitions. [2022-11-02 20:53:57,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 406 transitions, 903 flow [2022-11-02 20:53:57,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 406 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:53:57,306 INFO L231 Difference]: Finished difference. Result has 395 places, 401 transitions, 825 flow [2022-11-02 20:53:57,307 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=395, PETRI_TRANSITIONS=401} [2022-11-02 20:53:57,309 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -23 predicate places. [2022-11-02 20:53:57,310 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 401 transitions, 825 flow [2022-11-02 20:53:57,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:57,311 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] [2022-11-02 20:53:57,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:53:57,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2099345529, now seen corresponding path program 1 times [2022-11-02 20:53:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:57,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893439817] [2022-11-02 20:53:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:57,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:57,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893439817] [2022-11-02 20:53:57,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893439817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:57,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:57,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242907637] [2022-11-02 20:53:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:57,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:57,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:57,379 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-02 20:53:57,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 401 transitions, 825 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:57,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-02 20:53:57,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:57,522 INFO L130 PetriNetUnfolder]: 65/541 cut-off events. [2022-11-02 20:53:57,522 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-11-02 20:53:57,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 541 events. 65/541 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1934 event pairs, 30 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 634. Up to 90 conditions per place. [2022-11-02 20:53:57,533 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 32 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2022-11-02 20:53:57,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 401 transitions, 900 flow [2022-11-02 20:53:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-11-02 20:53:57,537 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9323254139668826 [2022-11-02 20:53:57,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-11-02 20:53:57,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-11-02 20:53:57,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:57,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-11-02 20:53:57,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,555 INFO L175 Difference]: Start difference. First operand has 395 places, 401 transitions, 825 flow. Second operand 3 states and 1295 transitions. [2022-11-02 20:53:57,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 401 transitions, 900 flow [2022-11-02 20:53:57,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 401 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:53:57,564 INFO L231 Difference]: Finished difference. Result has 391 places, 396 transitions, 823 flow [2022-11-02 20:53:57,565 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=391, PETRI_TRANSITIONS=396} [2022-11-02 20:53:57,566 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -27 predicate places. [2022-11-02 20:53:57,566 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 396 transitions, 823 flow [2022-11-02 20:53:57,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:57,568 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] [2022-11-02 20:53:57,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:53:57,568 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:57,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1479418596, now seen corresponding path program 1 times [2022-11-02 20:53:57,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:57,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978376360] [2022-11-02 20:53:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:57,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978376360] [2022-11-02 20:53:57,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978376360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:57,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:57,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101827562] [2022-11-02 20:53:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:57,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:57,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:57,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:57,617 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-02 20:53:57,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 396 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:57,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-02 20:53:57,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:57,855 INFO L130 PetriNetUnfolder]: 81/896 cut-off events. [2022-11-02 20:53:57,856 INFO L131 PetriNetUnfolder]: For 28/32 co-relation queries the response was YES. [2022-11-02 20:53:57,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 896 events. 81/896 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4413 event pairs, 33 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 994. Up to 90 conditions per place. [2022-11-02 20:53:57,876 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 35 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2022-11-02 20:53:57,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 399 transitions, 913 flow [2022-11-02 20:53:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2022-11-02 20:53:57,880 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9344852411807055 [2022-11-02 20:53:57,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1298 transitions. [2022-11-02 20:53:57,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1298 transitions. [2022-11-02 20:53:57,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:57,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1298 transitions. [2022-11-02 20:53:57,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,888 INFO L175 Difference]: Start difference. First operand has 391 places, 396 transitions, 823 flow. Second operand 3 states and 1298 transitions. [2022-11-02 20:53:57,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 399 transitions, 913 flow [2022-11-02 20:53:57,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 399 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:53:57,898 INFO L231 Difference]: Finished difference. Result has 387 places, 391 transitions, 821 flow [2022-11-02 20:53:57,899 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=387, PETRI_TRANSITIONS=391} [2022-11-02 20:53:57,900 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -31 predicate places. [2022-11-02 20:53:57,900 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 391 transitions, 821 flow [2022-11-02 20:53:57,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:57,901 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] [2022-11-02 20:53:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:53:57,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash -87068456, now seen corresponding path program 1 times [2022-11-02 20:53:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:57,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509265192] [2022-11-02 20:53:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509265192] [2022-11-02 20:53:57,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509265192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:57,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:57,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787421331] [2022-11-02 20:53:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:57,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:57,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:57,978 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-02 20:53:57,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 391 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:57,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:57,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-02 20:53:57,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:58,313 INFO L130 PetriNetUnfolder]: 123/936 cut-off events. [2022-11-02 20:53:58,313 INFO L131 PetriNetUnfolder]: For 65/69 co-relation queries the response was YES. [2022-11-02 20:53:58,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 936 events. 123/936 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4816 event pairs, 47 based on Foata normal form. 1/777 useless extension candidates. Maximal degree in co-relation 801. Up to 150 conditions per place. [2022-11-02 20:53:58,335 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 3 changer transitions 0/395 dead transitions. [2022-11-02 20:53:58,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 395 transitions, 916 flow [2022-11-02 20:53:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-11-02 20:53:58,339 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9352051835853131 [2022-11-02 20:53:58,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-11-02 20:53:58,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-11-02 20:53:58,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:58,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-11-02 20:53:58,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,347 INFO L175 Difference]: Start difference. First operand has 387 places, 391 transitions, 821 flow. Second operand 3 states and 1299 transitions. [2022-11-02 20:53:58,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 395 transitions, 916 flow [2022-11-02 20:53:58,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 395 transitions, 913 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:53:58,356 INFO L231 Difference]: Finished difference. Result has 383 places, 386 transitions, 819 flow [2022-11-02 20:53:58,357 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=819, PETRI_PLACES=383, PETRI_TRANSITIONS=386} [2022-11-02 20:53:58,358 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -35 predicate places. [2022-11-02 20:53:58,358 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 386 transitions, 819 flow [2022-11-02 20:53:58,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:58,359 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] [2022-11-02 20:53:58,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:53:58,359 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash -91411477, now seen corresponding path program 1 times [2022-11-02 20:53:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:58,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459915575] [2022-11-02 20:53:58,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:58,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459915575] [2022-11-02 20:53:58,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459915575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:58,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:58,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164026437] [2022-11-02 20:53:58,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:58,424 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-02 20:53:58,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 386 transitions, 819 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:58,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-02 20:53:58,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:58,814 INFO L130 PetriNetUnfolder]: 136/1506 cut-off events. [2022-11-02 20:53:58,815 INFO L131 PetriNetUnfolder]: For 94/98 co-relation queries the response was YES. [2022-11-02 20:53:58,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1506 events. 136/1506 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9229 event pairs, 59 based on Foata normal form. 0/1285 useless extension candidates. Maximal degree in co-relation 1080. Up to 167 conditions per place. [2022-11-02 20:53:58,845 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 37 selfloop transitions, 3 changer transitions 0/391 dead transitions. [2022-11-02 20:53:58,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 391 transitions, 919 flow [2022-11-02 20:53:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2022-11-02 20:53:58,849 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9359251259899208 [2022-11-02 20:53:58,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1300 transitions. [2022-11-02 20:53:58,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1300 transitions. [2022-11-02 20:53:58,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:58,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1300 transitions. [2022-11-02 20:53:58,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,857 INFO L175 Difference]: Start difference. First operand has 383 places, 386 transitions, 819 flow. Second operand 3 states and 1300 transitions. [2022-11-02 20:53:58,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 391 transitions, 919 flow [2022-11-02 20:53:58,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 391 transitions, 916 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:53:58,866 INFO L231 Difference]: Finished difference. Result has 379 places, 381 transitions, 817 flow [2022-11-02 20:53:58,867 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=379, PETRI_TRANSITIONS=381} [2022-11-02 20:53:58,867 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -39 predicate places. [2022-11-02 20:53:58,868 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 381 transitions, 817 flow [2022-11-02 20:53:58,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:58,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:58,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:53:58,869 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:58,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1947059132, now seen corresponding path program 1 times [2022-11-02 20:53:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:58,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038076669] [2022-11-02 20:53:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:58,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038076669] [2022-11-02 20:53:58,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038076669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:58,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:58,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90626966] [2022-11-02 20:53:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:58,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:58,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:58,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:58,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:58,911 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-02 20:53:58,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 381 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:58,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-02 20:53:58,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:59,344 INFO L130 PetriNetUnfolder]: 205/1762 cut-off events. [2022-11-02 20:53:59,344 INFO L131 PetriNetUnfolder]: For 185/189 co-relation queries the response was YES. [2022-11-02 20:53:59,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2254 conditions, 1762 events. 205/1762 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11751 event pairs, 104 based on Foata normal form. 1/1499 useless extension candidates. Maximal degree in co-relation 1036. Up to 261 conditions per place. [2022-11-02 20:53:59,381 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 3 changer transitions 8/387 dead transitions. [2022-11-02 20:53:59,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 387 transitions, 920 flow [2022-11-02 20:53:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:53:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2022-11-02 20:53:59,385 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9359251259899208 [2022-11-02 20:53:59,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1300 transitions. [2022-11-02 20:53:59,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1300 transitions. [2022-11-02 20:53:59,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:59,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1300 transitions. [2022-11-02 20:53:59,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:59,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:59,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:59,394 INFO L175 Difference]: Start difference. First operand has 379 places, 381 transitions, 817 flow. Second operand 3 states and 1300 transitions. [2022-11-02 20:53:59,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 387 transitions, 920 flow [2022-11-02 20:53:59,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 387 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:53:59,402 INFO L231 Difference]: Finished difference. Result has 375 places, 368 transitions, 799 flow [2022-11-02 20:53:59,403 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=375, PETRI_TRANSITIONS=368} [2022-11-02 20:53:59,403 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -43 predicate places. [2022-11-02 20:53:59,404 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 368 transitions, 799 flow [2022-11-02 20:53:59,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:59,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:59,405 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] [2022-11-02 20:53:59,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:53:59,405 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:53:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash 427726989, now seen corresponding path program 1 times [2022-11-02 20:53:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:59,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063379279] [2022-11-02 20:53:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:59,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:59,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063379279] [2022-11-02 20:53:59,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063379279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:59,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:59,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37179973] [2022-11-02 20:53:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:59,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:59,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:59,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:59,454 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 463 [2022-11-02 20:53:59,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 368 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:59,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:59,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 463 [2022-11-02 20:53:59,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:08,611 INFO L130 PetriNetUnfolder]: 16691/55209 cut-off events. [2022-11-02 20:54:08,611 INFO L131 PetriNetUnfolder]: For 1608/2188 co-relation queries the response was YES. [2022-11-02 20:54:09,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78893 conditions, 55209 events. 16691/55209 cut-off events. For 1608/2188 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 761413 event pairs, 7678 based on Foata normal form. 5/48007 useless extension candidates. Maximal degree in co-relation 27795. Up to 18943 conditions per place. [2022-11-02 20:54:09,413 INFO L137 encePairwiseOnDemand]: 445/463 looper letters, 30 selfloop transitions, 6 changer transitions 59/367 dead transitions. [2022-11-02 20:54:09,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 367 transitions, 898 flow [2022-11-02 20:54:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2022-11-02 20:54:09,417 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9136069114470843 [2022-11-02 20:54:09,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1269 transitions. [2022-11-02 20:54:09,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1269 transitions. [2022-11-02 20:54:09,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:09,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1269 transitions. [2022-11-02 20:54:09,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,426 INFO L175 Difference]: Start difference. First operand has 375 places, 368 transitions, 799 flow. Second operand 3 states and 1269 transitions. [2022-11-02 20:54:09,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 367 transitions, 898 flow [2022-11-02 20:54:09,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 367 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:54:09,645 INFO L231 Difference]: Finished difference. Result has 358 places, 303 transitions, 695 flow [2022-11-02 20:54:09,646 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=358, PETRI_TRANSITIONS=303} [2022-11-02 20:54:09,647 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -60 predicate places. [2022-11-02 20:54:09,647 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 303 transitions, 695 flow [2022-11-02 20:54:09,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:09,648 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] [2022-11-02 20:54:09,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:54:09,649 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1253586922, now seen corresponding path program 1 times [2022-11-02 20:54:09,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:09,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955711779] [2022-11-02 20:54:09,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:09,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:09,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955711779] [2022-11-02 20:54:09,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955711779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:09,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:09,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371397313] [2022-11-02 20:54:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:09,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:09,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:09,709 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-02 20:54:09,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 303 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:09,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-02 20:54:09,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:11,017 INFO L130 PetriNetUnfolder]: 1592/7175 cut-off events. [2022-11-02 20:54:11,017 INFO L131 PetriNetUnfolder]: For 37/57 co-relation queries the response was YES. [2022-11-02 20:54:11,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10116 conditions, 7175 events. 1592/7175 cut-off events. For 37/57 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 77334 event pairs, 442 based on Foata normal form. 0/6037 useless extension candidates. Maximal degree in co-relation 5406. Up to 1524 conditions per place. [2022-11-02 20:54:11,176 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2022-11-02 20:54:11,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 307 transitions, 770 flow [2022-11-02 20:54:11,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-02 20:54:11,181 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-02 20:54:11,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-02 20:54:11,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-02 20:54:11,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:11,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-02 20:54:11,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:11,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:11,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:11,189 INFO L175 Difference]: Start difference. First operand has 358 places, 303 transitions, 695 flow. Second operand 3 states and 1279 transitions. [2022-11-02 20:54:11,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 307 transitions, 770 flow [2022-11-02 20:54:11,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 307 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:11,199 INFO L231 Difference]: Finished difference. Result has 306 places, 302 transitions, 697 flow [2022-11-02 20:54:11,200 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=306, PETRI_TRANSITIONS=302} [2022-11-02 20:54:11,201 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -112 predicate places. [2022-11-02 20:54:11,201 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 302 transitions, 697 flow [2022-11-02 20:54:11,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:11,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:11,202 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] [2022-11-02 20:54:11,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:54:11,202 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:11,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1568621509, now seen corresponding path program 1 times [2022-11-02 20:54:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:11,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274621928] [2022-11-02 20:54:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:11,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:11,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274621928] [2022-11-02 20:54:11,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274621928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:11,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:11,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93638090] [2022-11-02 20:54:11,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:11,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:11,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:11,253 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-02 20:54:11,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 302 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:11,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:11,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-02 20:54:11,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:12,886 INFO L130 PetriNetUnfolder]: 2189/8489 cut-off events. [2022-11-02 20:54:12,886 INFO L131 PetriNetUnfolder]: For 89/117 co-relation queries the response was YES. [2022-11-02 20:54:12,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13097 conditions, 8489 events. 2189/8489 cut-off events. For 89/117 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 92658 event pairs, 838 based on Foata normal form. 0/7379 useless extension candidates. Maximal degree in co-relation 12747. Up to 1755 conditions per place. [2022-11-02 20:54:13,028 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2022-11-02 20:54:13,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 306 transitions, 772 flow [2022-11-02 20:54:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-02 20:54:13,032 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-02 20:54:13,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-02 20:54:13,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-02 20:54:13,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:13,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-02 20:54:13,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:13,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:13,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:13,040 INFO L175 Difference]: Start difference. First operand has 306 places, 302 transitions, 697 flow. Second operand 3 states and 1279 transitions. [2022-11-02 20:54:13,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 306 transitions, 772 flow [2022-11-02 20:54:13,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 306 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:13,050 INFO L231 Difference]: Finished difference. Result has 305 places, 301 transitions, 695 flow [2022-11-02 20:54:13,050 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2022-11-02 20:54:13,051 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -113 predicate places. [2022-11-02 20:54:13,051 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 695 flow [2022-11-02 20:54:13,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:13,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:13,052 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] [2022-11-02 20:54:13,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:54:13,053 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1789669962, now seen corresponding path program 1 times [2022-11-02 20:54:13,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:13,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18207940] [2022-11-02 20:54:13,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:13,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:13,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18207940] [2022-11-02 20:54:13,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18207940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:13,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:13,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046860996] [2022-11-02 20:54:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:13,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:13,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:13,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:13,108 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-02 20:54:13,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:13,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:13,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-02 20:54:13,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:13,865 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [42#L41-5true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 509#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-02 20:54:13,865 INFO L383 tUnfolder$Statistics]: this new event has 134 ancestors and is cut-off event [2022-11-02 20:54:13,865 INFO L386 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-11-02 20:54:13,865 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:54:13,865 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:54:13,915 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 514#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:13,915 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-02 20:54:13,915 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:54:13,915 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:54:13,915 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:54:14,373 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true, 228#L73-5true]) [2022-11-02 20:54:14,374 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-02 20:54:14,374 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:54:14,374 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:54:14,374 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-02 20:54:14,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,419 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-02 20:54:14,419 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:54:14,420 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:54:14,420 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:54:14,420 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [42#L41-5true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 509#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true, 228#L73-5true]) [2022-11-02 20:54:14,420 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-02 20:54:14,420 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:54:14,420 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:54:14,420 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:54:14,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,421 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:54:14,421 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:54:14,421 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:54:14,421 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:54:14,422 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,422 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:54:14,422 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:54:14,422 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:54:14,423 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:54:14,423 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:54:14,439 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,440 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-02 20:54:14,440 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:54:14,440 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:54:14,440 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:54:14,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 514#true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 509#true, 528#true, 380#L81-2true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-02 20:54:14,482 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-02 20:54:14,482 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:54:14,482 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:54:14,482 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:54:14,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,634 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-02 20:54:14,635 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:54:14,635 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:54:14,635 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-02 20:54:14,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true, 228#L73-5true]) [2022-11-02 20:54:14,698 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-02 20:54:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:54:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:54:14,698 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:54:14,699 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,699 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-02 20:54:14,699 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-02 20:54:14,699 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-02 20:54:14,699 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:54:14,699 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,699 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-02 20:54:14,699 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:54:14,700 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-02 20:54:14,700 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:54:14,700 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,701 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-02 20:54:14,701 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-02 20:54:14,701 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:54:14,701 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-02 20:54:14,701 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:54:14,744 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true, 228#L73-5true]) [2022-11-02 20:54:14,744 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-02 20:54:14,744 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-02 20:54:14,744 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:54:14,745 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-02 20:54:14,914 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,914 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-02 20:54:14,915 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:54:14,915 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:54:14,915 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:54:14,990 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 380#L81-2true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:14,990 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-02 20:54:14,990 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:54:14,990 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-02 20:54:14,990 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:54:14,990 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-02 20:54:15,495 INFO L130 PetriNetUnfolder]: 2457/11284 cut-off events. [2022-11-02 20:54:15,495 INFO L131 PetriNetUnfolder]: For 414/514 co-relation queries the response was YES. [2022-11-02 20:54:15,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16462 conditions, 11284 events. 2457/11284 cut-off events. For 414/514 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 131115 event pairs, 819 based on Foata normal form. 0/9794 useless extension candidates. Maximal degree in co-relation 15282. Up to 2051 conditions per place. [2022-11-02 20:54:15,794 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-02 20:54:15,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 770 flow [2022-11-02 20:54:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-02 20:54:15,799 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-02 20:54:15,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-02 20:54:15,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-02 20:54:15,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:15,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-02 20:54:15,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:15,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:15,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:15,807 INFO L175 Difference]: Start difference. First operand has 305 places, 301 transitions, 695 flow. Second operand 3 states and 1279 transitions. [2022-11-02 20:54:15,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 770 flow [2022-11-02 20:54:15,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 305 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:15,822 INFO L231 Difference]: Finished difference. Result has 304 places, 300 transitions, 693 flow [2022-11-02 20:54:15,823 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=304, PETRI_TRANSITIONS=300} [2022-11-02 20:54:15,823 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -114 predicate places. [2022-11-02 20:54:15,823 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 300 transitions, 693 flow [2022-11-02 20:54:15,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:15,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:15,824 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] [2022-11-02 20:54:15,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:54:15,825 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:15,825 INFO L85 PathProgramCache]: Analyzing trace with hash -187429401, now seen corresponding path program 1 times [2022-11-02 20:54:15,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:15,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011884964] [2022-11-02 20:54:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:15,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:15,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011884964] [2022-11-02 20:54:15,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011884964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:15,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:15,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:15,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807898264] [2022-11-02 20:54:15,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:15,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:15,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:15,892 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-02 20:54:15,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 300 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:15,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:15,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-02 20:54:15,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:17,132 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, 536#true, 69#L49-5true, Black: 494#true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:17,132 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-02 20:54:17,132 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:54:17,132 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:54:17,132 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:54:17,172 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 536#true, 69#L49-5true, Black: 494#true, 291#L108-4true, Black: 499#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:17,172 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-02 20:54:17,172 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:54:17,173 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:54:17,173 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:54:17,252 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:17,252 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:54:17,252 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:54:17,252 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:54:17,252 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:54:17,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:17,284 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-02 20:54:17,284 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:54:17,284 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:54:17,284 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-02 20:54:17,332 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 69#L49-5true, 536#true, Black: 494#true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:17,332 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-02 20:54:17,332 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:54:17,332 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:54:17,332 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:54:17,418 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-02 20:54:17,419 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-02 20:54:17,419 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-02 20:54:17,419 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:54:17,419 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:54:18,064 INFO L130 PetriNetUnfolder]: 2207/9806 cut-off events. [2022-11-02 20:54:18,064 INFO L131 PetriNetUnfolder]: For 453/537 co-relation queries the response was YES. [2022-11-02 20:54:18,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14379 conditions, 9806 events. 2207/9806 cut-off events. For 453/537 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 109593 event pairs, 740 based on Foata normal form. 0/8494 useless extension candidates. Maximal degree in co-relation 13765. Up to 1834 conditions per place. [2022-11-02 20:54:18,218 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2022-11-02 20:54:18,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 768 flow [2022-11-02 20:54:18,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-02 20:54:18,221 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-02 20:54:18,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-02 20:54:18,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-02 20:54:18,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:18,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-02 20:54:18,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,229 INFO L175 Difference]: Start difference. First operand has 304 places, 300 transitions, 693 flow. Second operand 3 states and 1279 transitions. [2022-11-02 20:54:18,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 768 flow [2022-11-02 20:54:18,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 304 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:18,241 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 691 flow [2022-11-02 20:54:18,241 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2022-11-02 20:54:18,242 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-02 20:54:18,242 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 691 flow [2022-11-02 20:54:18,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:18,243 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] [2022-11-02 20:54:18,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:54:18,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:18,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash -260389847, now seen corresponding path program 1 times [2022-11-02 20:54:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:18,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369093393] [2022-11-02 20:54:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:18,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369093393] [2022-11-02 20:54:18,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369093393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:18,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:18,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:18,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963181797] [2022-11-02 20:54:18,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:18,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:18,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:18,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:18,313 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-02 20:54:18,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:18,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-02 20:54:18,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:19,952 INFO L130 PetriNetUnfolder]: 1821/7649 cut-off events. [2022-11-02 20:54:19,952 INFO L131 PetriNetUnfolder]: For 457/521 co-relation queries the response was YES. [2022-11-02 20:54:20,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11072 conditions, 7649 events. 1821/7649 cut-off events. For 457/521 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 78616 event pairs, 612 based on Foata normal form. 0/6569 useless extension candidates. Maximal degree in co-relation 10251. Up to 1594 conditions per place. [2022-11-02 20:54:20,123 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2022-11-02 20:54:20,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 303 transitions, 766 flow [2022-11-02 20:54:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-02 20:54:20,127 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-02 20:54:20,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-02 20:54:20,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-02 20:54:20,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:20,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-02 20:54:20,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:20,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:20,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:20,135 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 691 flow. Second operand 3 states and 1279 transitions. [2022-11-02 20:54:20,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 303 transitions, 766 flow [2022-11-02 20:54:20,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 303 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:20,149 INFO L231 Difference]: Finished difference. Result has 302 places, 298 transitions, 689 flow [2022-11-02 20:54:20,150 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=302, PETRI_TRANSITIONS=298} [2022-11-02 20:54:20,150 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -116 predicate places. [2022-11-02 20:54:20,151 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 298 transitions, 689 flow [2022-11-02 20:54:20,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:20,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:20,152 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] [2022-11-02 20:54:20,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:54:20,152 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:20,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1626420513, now seen corresponding path program 1 times [2022-11-02 20:54:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:20,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436315300] [2022-11-02 20:54:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:20,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:20,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436315300] [2022-11-02 20:54:20,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436315300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:20,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:20,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832046864] [2022-11-02 20:54:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:20,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:20,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:20,753 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-02 20:54:20,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 298 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:20,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:20,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-02 20:54:20,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:21,901 INFO L130 PetriNetUnfolder]: 952/4738 cut-off events. [2022-11-02 20:54:21,901 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-02 20:54:21,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6643 conditions, 4738 events. 952/4738 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 44085 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6281. Up to 1060 conditions per place. [2022-11-02 20:54:22,016 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 46 selfloop transitions, 4 changer transitions 0/297 dead transitions. [2022-11-02 20:54:22,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 297 transitions, 787 flow [2022-11-02 20:54:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:54:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2451 transitions. [2022-11-02 20:54:22,023 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8822894168466523 [2022-11-02 20:54:22,023 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2451 transitions. [2022-11-02 20:54:22,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2451 transitions. [2022-11-02 20:54:22,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:22,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2451 transitions. [2022-11-02 20:54:22,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.5) internal successors, (2451), 6 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:22,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:22,037 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:22,037 INFO L175 Difference]: Start difference. First operand has 302 places, 298 transitions, 689 flow. Second operand 6 states and 2451 transitions. [2022-11-02 20:54:22,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 297 transitions, 787 flow [2022-11-02 20:54:22,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 297 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:22,047 INFO L231 Difference]: Finished difference. Result has 304 places, 297 transitions, 691 flow [2022-11-02 20:54:22,048 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=691, PETRI_PLACES=304, PETRI_TRANSITIONS=297} [2022-11-02 20:54:22,048 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -114 predicate places. [2022-11-02 20:54:22,049 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 297 transitions, 691 flow [2022-11-02 20:54:22,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:22,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:22,050 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] [2022-11-02 20:54:22,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:54:22,050 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1800624235, now seen corresponding path program 1 times [2022-11-02 20:54:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285791579] [2022-11-02 20:54:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:22,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:22,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285791579] [2022-11-02 20:54:22,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285791579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:22,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:22,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506512367] [2022-11-02 20:54:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:22,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:22,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:22,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:22,154 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-02 20:54:22,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 297 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:22,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:22,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-02 20:54:22,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:23,789 INFO L130 PetriNetUnfolder]: 1513/6421 cut-off events. [2022-11-02 20:54:23,789 INFO L131 PetriNetUnfolder]: For 377/425 co-relation queries the response was YES. [2022-11-02 20:54:23,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9078 conditions, 6421 events. 1513/6421 cut-off events. For 377/425 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 62140 event pairs, 504 based on Foata normal form. 0/5521 useless extension candidates. Maximal degree in co-relation 5845. Up to 1327 conditions per place. [2022-11-02 20:54:24,077 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-02 20:54:24,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 301 transitions, 766 flow [2022-11-02 20:54:24,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-02 20:54:24,080 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-02 20:54:24,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-02 20:54:24,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-02 20:54:24,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:24,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-02 20:54:24,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:24,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:24,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:24,088 INFO L175 Difference]: Start difference. First operand has 304 places, 297 transitions, 691 flow. Second operand 3 states and 1279 transitions. [2022-11-02 20:54:24,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 301 transitions, 766 flow [2022-11-02 20:54:24,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 759 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:54:24,096 INFO L231 Difference]: Finished difference. Result has 301 places, 296 transitions, 686 flow [2022-11-02 20:54:24,097 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2022-11-02 20:54:24,097 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -117 predicate places. [2022-11-02 20:54:24,098 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 686 flow [2022-11-02 20:54:24,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:24,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:24,099 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] [2022-11-02 20:54:24,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:54:24,099 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1746432846, now seen corresponding path program 1 times [2022-11-02 20:54:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:24,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777395236] [2022-11-02 20:54:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:24,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777395236] [2022-11-02 20:54:24,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777395236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:24,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:24,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:24,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317710590] [2022-11-02 20:54:24,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:24,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:24,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:24,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:24,694 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-02 20:54:24,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 403.5) internal successors, (2421), 6 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:24,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:24,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-02 20:54:24,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:25,601 INFO L130 PetriNetUnfolder]: 964/4774 cut-off events. [2022-11-02 20:54:25,602 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-02 20:54:25,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6667 conditions, 4774 events. 964/4774 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 44340 event pairs, 172 based on Foata normal form. 0/4186 useless extension candidates. Maximal degree in co-relation 6381. Up to 1084 conditions per place. [2022-11-02 20:54:25,697 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 45 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-11-02 20:54:25,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 295 transitions, 782 flow [2022-11-02 20:54:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:54:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2450 transitions. [2022-11-02 20:54:25,702 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8819294456443485 [2022-11-02 20:54:25,702 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2450 transitions. [2022-11-02 20:54:25,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2450 transitions. [2022-11-02 20:54:25,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:25,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2450 transitions. [2022-11-02 20:54:25,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.3333333333333) internal successors, (2450), 6 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:25,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:25,713 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:25,713 INFO L175 Difference]: Start difference. First operand has 301 places, 296 transitions, 686 flow. Second operand 6 states and 2450 transitions. [2022-11-02 20:54:25,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 295 transitions, 782 flow [2022-11-02 20:54:25,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 295 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:25,721 INFO L231 Difference]: Finished difference. Result has 303 places, 295 transitions, 688 flow [2022-11-02 20:54:25,722 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=688, PETRI_PLACES=303, PETRI_TRANSITIONS=295} [2022-11-02 20:54:25,723 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-02 20:54:25,723 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 295 transitions, 688 flow [2022-11-02 20:54:25,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 403.5) internal successors, (2421), 6 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:25,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:25,724 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] [2022-11-02 20:54:25,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:54:25,724 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 414197575, now seen corresponding path program 1 times [2022-11-02 20:54:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:25,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161102827] [2022-11-02 20:54:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:26,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:26,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161102827] [2022-11-02 20:54:26,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161102827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:26,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:26,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:26,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045419573] [2022-11-02 20:54:26,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:26,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:26,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:26,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:26,311 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-02 20:54:26,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 295 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 404.5) internal successors, (2427), 6 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:26,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:26,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-02 20:54:26,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:27,346 INFO L130 PetriNetUnfolder]: 964/4754 cut-off events. [2022-11-02 20:54:27,346 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:54:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6635 conditions, 4754 events. 964/4754 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 44344 event pairs, 172 based on Foata normal form. 0/4186 useless extension candidates. Maximal degree in co-relation 5901. Up to 1084 conditions per place. [2022-11-02 20:54:27,437 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 44 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2022-11-02 20:54:27,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 782 flow [2022-11-02 20:54:27,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:54:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2449 transitions. [2022-11-02 20:54:27,442 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8815694744420446 [2022-11-02 20:54:27,442 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2449 transitions. [2022-11-02 20:54:27,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2449 transitions. [2022-11-02 20:54:27,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:27,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2449 transitions. [2022-11-02 20:54:27,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.1666666666667) internal successors, (2449), 6 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:27,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:27,452 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:27,452 INFO L175 Difference]: Start difference. First operand has 303 places, 295 transitions, 688 flow. Second operand 6 states and 2449 transitions. [2022-11-02 20:54:27,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 294 transitions, 782 flow [2022-11-02 20:54:27,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 294 transitions, 775 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:54:27,460 INFO L231 Difference]: Finished difference. Result has 303 places, 294 transitions, 687 flow [2022-11-02 20:54:27,461 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=303, PETRI_TRANSITIONS=294} [2022-11-02 20:54:27,461 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-02 20:54:27,462 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 294 transitions, 687 flow [2022-11-02 20:54:27,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.5) internal successors, (2427), 6 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:27,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:27,463 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] [2022-11-02 20:54:27,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:54:27,463 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2039170337, now seen corresponding path program 1 times [2022-11-02 20:54:27,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:27,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925484361] [2022-11-02 20:54:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:28,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925484361] [2022-11-02 20:54:28,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925484361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:28,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:28,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870436802] [2022-11-02 20:54:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:28,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:28,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:28,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:28,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:28,074 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-02 20:54:28,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 294 transitions, 687 flow. Second operand has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:28,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:28,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-02 20:54:28,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:28,889 INFO L130 PetriNetUnfolder]: 952/4692 cut-off events. [2022-11-02 20:54:28,889 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-02 20:54:28,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6585 conditions, 4692 events. 952/4692 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 43431 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 5941. Up to 1060 conditions per place. [2022-11-02 20:54:28,982 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 43 selfloop transitions, 4 changer transitions 0/293 dead transitions. [2022-11-02 20:54:28,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 293 transitions, 779 flow [2022-11-02 20:54:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:54:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2448 transitions. [2022-11-02 20:54:28,989 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8812095032397408 [2022-11-02 20:54:28,989 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2448 transitions. [2022-11-02 20:54:28,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2448 transitions. [2022-11-02 20:54:28,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:28,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2448 transitions. [2022-11-02 20:54:28,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.0) internal successors, (2448), 6 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:28,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:28,996 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:28,996 INFO L175 Difference]: Start difference. First operand has 303 places, 294 transitions, 687 flow. Second operand 6 states and 2448 transitions. [2022-11-02 20:54:28,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 293 transitions, 779 flow [2022-11-02 20:54:29,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 293 transitions, 772 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:54:29,005 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 686 flow [2022-11-02 20:54:29,005 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=686, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2022-11-02 20:54:29,006 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-02 20:54:29,006 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 686 flow [2022-11-02 20:54:29,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:29,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:29,007 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] [2022-11-02 20:54:29,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:54:29,007 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:29,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash -541393963, now seen corresponding path program 1 times [2022-11-02 20:54:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:29,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040871518] [2022-11-02 20:54:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:29,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:29,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040871518] [2022-11-02 20:54:29,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040871518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:29,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:29,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:29,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066090551] [2022-11-02 20:54:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:29,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:29,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:29,687 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-02 20:54:29,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:29,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:29,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-02 20:54:29,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:30,870 INFO L130 PetriNetUnfolder]: 964/4734 cut-off events. [2022-11-02 20:54:30,870 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 20:54:30,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6645 conditions, 4734 events. 964/4734 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 44150 event pairs, 172 based on Foata normal form. 0/4186 useless extension candidates. Maximal degree in co-relation 6301. Up to 1084 conditions per place. [2022-11-02 20:54:30,918 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 42 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-11-02 20:54:30,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 292 transitions, 776 flow [2022-11-02 20:54:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:54:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2022-11-02 20:54:30,926 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.880849532037437 [2022-11-02 20:54:30,926 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2447 transitions. [2022-11-02 20:54:30,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2447 transitions. [2022-11-02 20:54:30,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:30,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2447 transitions. [2022-11-02 20:54:30,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 407.8333333333333) internal successors, (2447), 6 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:30,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:30,935 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:30,935 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 686 flow. Second operand 6 states and 2447 transitions. [2022-11-02 20:54:30,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 292 transitions, 776 flow [2022-11-02 20:54:30,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 292 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:54:30,940 INFO L231 Difference]: Finished difference. Result has 303 places, 292 transitions, 685 flow [2022-11-02 20:54:30,941 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=685, PETRI_PLACES=303, PETRI_TRANSITIONS=292} [2022-11-02 20:54:30,941 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-02 20:54:30,941 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 292 transitions, 685 flow [2022-11-02 20:54:30,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:30,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:30,942 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] [2022-11-02 20:54:30,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:54:30,942 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-02 20:54:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1072275228, now seen corresponding path program 1 times [2022-11-02 20:54:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:30,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860744394] [2022-11-02 20:54:30,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:31,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860744394] [2022-11-02 20:54:31,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860744394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:31,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:31,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883896797] [2022-11-02 20:54:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:31,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:31,628 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-02 20:54:31,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 292 transitions, 685 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:31,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:31,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-02 20:54:31,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:32,484 INFO L130 PetriNetUnfolder]: 952/4683 cut-off events. [2022-11-02 20:54:32,484 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:54:32,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6534 conditions, 4683 events. 952/4683 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 43439 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6395. Up to 1060 conditions per place. [2022-11-02 20:54:32,556 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 0 selfloop transitions, 0 changer transitions 291/291 dead transitions. [2022-11-02 20:54:32,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 291 transitions, 773 flow [2022-11-02 20:54:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:54:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2446 transitions. [2022-11-02 20:54:32,563 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8804895608351332 [2022-11-02 20:54:32,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2446 transitions. [2022-11-02 20:54:32,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2446 transitions. [2022-11-02 20:54:32,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:32,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2446 transitions. [2022-11-02 20:54:32,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 407.6666666666667) internal successors, (2446), 6 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:32,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:32,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:32,569 INFO L175 Difference]: Start difference. First operand has 303 places, 292 transitions, 685 flow. Second operand 6 states and 2446 transitions. [2022-11-02 20:54:32,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 291 transitions, 773 flow [2022-11-02 20:54:32,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 291 transitions, 766 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:54:32,573 INFO L231 Difference]: Finished difference. Result has 303 places, 0 transitions, 0 flow [2022-11-02 20:54:32,573 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=303, PETRI_TRANSITIONS=0} [2022-11-02 20:54:32,574 INFO L287 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-02 20:54:32,574 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 0 transitions, 0 flow [2022-11-02 20:54:32,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:32,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (102 of 103 remaining) [2022-11-02 20:54:32,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (101 of 103 remaining) [2022-11-02 20:54:32,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (100 of 103 remaining) [2022-11-02 20:54:32,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 103 remaining) [2022-11-02 20:54:32,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (98 of 103 remaining) [2022-11-02 20:54:32,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (97 of 103 remaining) [2022-11-02 20:54:32,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 103 remaining) [2022-11-02 20:54:32,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 103 remaining) [2022-11-02 20:54:32,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (94 of 103 remaining) [2022-11-02 20:54:32,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (93 of 103 remaining) [2022-11-02 20:54:32,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 103 remaining) [2022-11-02 20:54:32,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 103 remaining) [2022-11-02 20:54:32,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 103 remaining) [2022-11-02 20:54:32,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 103 remaining) [2022-11-02 20:54:32,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 103 remaining) [2022-11-02 20:54:32,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (87 of 103 remaining) [2022-11-02 20:54:32,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (86 of 103 remaining) [2022-11-02 20:54:32,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 103 remaining) [2022-11-02 20:54:32,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (84 of 103 remaining) [2022-11-02 20:54:32,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (83 of 103 remaining) [2022-11-02 20:54:32,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (82 of 103 remaining) [2022-11-02 20:54:32,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (81 of 103 remaining) [2022-11-02 20:54:32,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 103 remaining) [2022-11-02 20:54:32,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (79 of 103 remaining) [2022-11-02 20:54:32,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 103 remaining) [2022-11-02 20:54:32,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (77 of 103 remaining) [2022-11-02 20:54:32,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (76 of 103 remaining) [2022-11-02 20:54:32,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (75 of 103 remaining) [2022-11-02 20:54:32,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (74 of 103 remaining) [2022-11-02 20:54:32,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (73 of 103 remaining) [2022-11-02 20:54:32,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (72 of 103 remaining) [2022-11-02 20:54:32,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (71 of 103 remaining) [2022-11-02 20:54:32,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (70 of 103 remaining) [2022-11-02 20:54:32,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 103 remaining) [2022-11-02 20:54:32,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (68 of 103 remaining) [2022-11-02 20:54:32,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (67 of 103 remaining) [2022-11-02 20:54:32,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (66 of 103 remaining) [2022-11-02 20:54:32,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (65 of 103 remaining) [2022-11-02 20:54:32,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (64 of 103 remaining) [2022-11-02 20:54:32,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 103 remaining) [2022-11-02 20:54:32,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (62 of 103 remaining) [2022-11-02 20:54:32,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (61 of 103 remaining) [2022-11-02 20:54:32,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (60 of 103 remaining) [2022-11-02 20:54:32,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (59 of 103 remaining) [2022-11-02 20:54:32,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (58 of 103 remaining) [2022-11-02 20:54:32,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (57 of 103 remaining) [2022-11-02 20:54:32,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (56 of 103 remaining) [2022-11-02 20:54:32,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (55 of 103 remaining) [2022-11-02 20:54:32,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (54 of 103 remaining) [2022-11-02 20:54:32,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (53 of 103 remaining) [2022-11-02 20:54:32,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (52 of 103 remaining) [2022-11-02 20:54:32,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (51 of 103 remaining) [2022-11-02 20:54:32,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 103 remaining) [2022-11-02 20:54:32,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 103 remaining) [2022-11-02 20:54:32,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 103 remaining) [2022-11-02 20:54:32,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 103 remaining) [2022-11-02 20:54:32,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 103 remaining) [2022-11-02 20:54:32,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 103 remaining) [2022-11-02 20:54:32,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 103 remaining) [2022-11-02 20:54:32,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 103 remaining) [2022-11-02 20:54:32,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 103 remaining) [2022-11-02 20:54:32,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 103 remaining) [2022-11-02 20:54:32,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 103 remaining) [2022-11-02 20:54:32,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 103 remaining) [2022-11-02 20:54:32,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 103 remaining) [2022-11-02 20:54:32,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 103 remaining) [2022-11-02 20:54:32,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 103 remaining) [2022-11-02 20:54:32,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 103 remaining) [2022-11-02 20:54:32,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 103 remaining) [2022-11-02 20:54:32,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 103 remaining) [2022-11-02 20:54:32,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 103 remaining) [2022-11-02 20:54:32,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 103 remaining) [2022-11-02 20:54:32,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 103 remaining) [2022-11-02 20:54:32,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 103 remaining) [2022-11-02 20:54:32,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 103 remaining) [2022-11-02 20:54:32,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 103 remaining) [2022-11-02 20:54:32,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 103 remaining) [2022-11-02 20:54:32,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 103 remaining) [2022-11-02 20:54:32,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 103 remaining) [2022-11-02 20:54:32,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 103 remaining) [2022-11-02 20:54:32,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 103 remaining) [2022-11-02 20:54:32,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 103 remaining) [2022-11-02 20:54:32,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 103 remaining) [2022-11-02 20:54:32,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 103 remaining) [2022-11-02 20:54:32,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 103 remaining) [2022-11-02 20:54:32,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 103 remaining) [2022-11-02 20:54:32,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 103 remaining) [2022-11-02 20:54:32,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 103 remaining) [2022-11-02 20:54:32,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 103 remaining) [2022-11-02 20:54:32,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 103 remaining) [2022-11-02 20:54:32,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 103 remaining) [2022-11-02 20:54:32,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 103 remaining) [2022-11-02 20:54:32,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 103 remaining) [2022-11-02 20:54:32,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 103 remaining) [2022-11-02 20:54:32,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 103 remaining) [2022-11-02 20:54:32,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 103 remaining) [2022-11-02 20:54:32,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 103 remaining) [2022-11-02 20:54:32,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 103 remaining) [2022-11-02 20:54:32,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 103 remaining) [2022-11-02 20:54:32,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 103 remaining) [2022-11-02 20:54:32,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 103 remaining) [2022-11-02 20:54:32,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 103 remaining) [2022-11-02 20:54:32,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 103 remaining) [2022-11-02 20:54:32,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:54:32,600 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:32,606 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:54:32,606 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:54:32,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:54:32 BasicIcfg [2022-11-02 20:54:32,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:54:32,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:54:32,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:54:32,614 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:54:32,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:35" (3/4) ... [2022-11-02 20:54:32,617 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:54:32,623 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:54:32,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:54:32,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:54:32,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:54:32,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2022-11-02 20:54:32,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2022-11-02 20:54:32,632 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-02 20:54:32,632 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:54:32,633 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:54:32,633 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:54:32,683 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:54:32,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:54:32,684 INFO L158 Benchmark]: Toolchain (without parser) took 58796.30ms. Allocated memory was 130.0MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 96.3MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-02 20:54:32,685 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 46.9MB in the beginning and 46.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:54:32,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.31ms. Allocated memory is still 130.0MB. Free memory was 96.3MB in the beginning and 103.1MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:54:32,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.04ms. Allocated memory is still 130.0MB. Free memory was 103.1MB in the beginning and 100.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:54:32,686 INFO L158 Benchmark]: Boogie Preprocessor took 44.54ms. Allocated memory is still 130.0MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:54:32,686 INFO L158 Benchmark]: RCFGBuilder took 1106.08ms. Allocated memory is still 130.0MB. Free memory was 98.3MB in the beginning and 66.2MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-02 20:54:32,686 INFO L158 Benchmark]: TraceAbstraction took 57044.85ms. Allocated memory was 130.0MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 66.0MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-02 20:54:32,687 INFO L158 Benchmark]: Witness Printer took 70.70ms. Allocated memory is still 13.1GB. Free memory was 10.6GB in the beginning and 10.6GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:54:32,689 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 46.9MB in the beginning and 46.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.31ms. Allocated memory is still 130.0MB. Free memory was 96.3MB in the beginning and 103.1MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.04ms. Allocated memory is still 130.0MB. Free memory was 103.1MB in the beginning and 100.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.54ms. Allocated memory is still 130.0MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1106.08ms. Allocated memory is still 130.0MB. Free memory was 98.3MB in the beginning and 66.2MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 57044.85ms. Allocated memory was 130.0MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 66.0MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 70.70ms. Allocated memory is still 13.1GB. Free memory was 10.6GB in the beginning and 10.6GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 578 locations, 103 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 56.8s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 462 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1363 IncrementalHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 462 mSDtfsCounter, 1363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=878occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2533 NumberOfCodeBlocks, 2533 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2507 ConstructedInterpolants, 0 QuantifiedInterpolants, 3033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:54:32,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06608be2-38dc-4e39-9404-cc026be99b3c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE