./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b 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_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN --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 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb --- 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-6b4ec56 [2022-11-20 12:14:03,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:14:03,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:14:03,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:14:03,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:14:03,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:14:03,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:14:03,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:14:03,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:14:03,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:14:03,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:14:03,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:14:03,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:14:03,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:14:03,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:14:03,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:14:03,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:14:03,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:14:03,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:14:03,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:14:03,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:14:03,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:14:03,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:14:03,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:14:03,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:14:03,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:14:03,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:14:03,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:14:03,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:14:03,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:14:03,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:14:03,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:14:03,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:14:03,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:14:03,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:14:03,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:14:03,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:14:03,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:14:03,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:14:03,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:14:03,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:14:03,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 12:14:03,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:14:03,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:14:03,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:14:03,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:14:03,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:14:03,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:14:03,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:14:03,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:14:03,597 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:14:03,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:14:03,598 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:14:03,598 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:14:03,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:14:03,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:14:03,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:14:03,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:14:03,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:14:03,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:14:03,599 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 12:14:03,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:14:03,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:14:03,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:14:03,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:14:03,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:14:03,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:14:03,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:14:03,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:14:03,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:14:03,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:14:03,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:14:03,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:14:03,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:14:03,603 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:14:03,604 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:14:03,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:14:03,604 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_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/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_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN 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 -> 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb [2022-11-20 12:14:03,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:14:03,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:14:03,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:14:03,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:14:03,917 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:14:03,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2022-11-20 12:14:06,873 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:14:07,121 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:14:07,133 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2022-11-20 12:14:07,150 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/data/2edc61820/c3985e6631624bbf886977f460618e0d/FLAG2a4d1eb70 [2022-11-20 12:14:07,171 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/data/2edc61820/c3985e6631624bbf886977f460618e0d [2022-11-20 12:14:07,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:14:07,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:14:07,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:14:07,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:14:07,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:14:07,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:07,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e112f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07, skipping insertion in model container [2022-11-20 12:14:07,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:07,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:14:07,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:14:07,766 WARN L237 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_410f4036-124d-4443-89dd-c3c0be6d73ba/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i[30358,30371] [2022-11-20 12:14:07,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:14:07,799 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:14:07,849 WARN L237 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_410f4036-124d-4443-89dd-c3c0be6d73ba/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i[30358,30371] [2022-11-20 12:14:07,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:14:07,922 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:14:07,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07 WrapperNode [2022-11-20 12:14:07,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:14:07,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:14:07,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:14:07,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:14:07,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:07,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:07,980 INFO L138 Inliner]: procedures = 170, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 166 [2022-11-20 12:14:07,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:14:07,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:14:07,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:14:07,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:14:07,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:07,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:07,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:07,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:08,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:08,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:08,011 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:08,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:08,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:14:08,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:14:08,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:14:08,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:14:08,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (1/1) ... [2022-11-20 12:14:08,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:14:08,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:14:08,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:14:08,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:14:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:14:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:14:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:14:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-20 12:14:08,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-20 12:14:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:14:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:14:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:14:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:14:08,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:14:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-20 12:14:08,117 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-20 12:14:08,119 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:14:08,360 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:14:08,363 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:14:08,727 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:14:08,837 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:14:08,837 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:14:08,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:14:08 BoogieIcfgContainer [2022-11-20 12:14:08,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:14:08,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:14:08,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:14:08,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:14:08,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:14:07" (1/3) ... [2022-11-20 12:14:08,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26528e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:14:08, skipping insertion in model container [2022-11-20 12:14:08,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:14:07" (2/3) ... [2022-11-20 12:14:08,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26528e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:14:08, skipping insertion in model container [2022-11-20 12:14:08,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:14:08" (3/3) ... [2022-11-20 12:14:08,855 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2b.i [2022-11-20 12:14:08,867 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:14:08,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:14:08,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-20 12:14:08,880 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:14:09,039 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-20 12:14:09,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 210 transitions, 452 flow [2022-11-20 12:14:09,182 INFO L130 PetriNetUnfolder]: 2/206 cut-off events. [2022-11-20 12:14:09,183 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 12:14:09,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 206 events. 2/206 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 396 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-11-20 12:14:09,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 210 transitions, 452 flow [2022-11-20 12:14:09,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 192 transitions, 405 flow [2022-11-20 12:14:09,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:14:09,217 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;@393764b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:14:09,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-20 12:14:09,244 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-20 12:14:09,244 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:14:09,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:09,246 INFO L209 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] [2022-11-20 12:14:09,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash -501401202, now seen corresponding path program 1 times [2022-11-20 12:14:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:09,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989476336] [2022-11-20 12:14:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:09,634 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-20 12:14:09,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:09,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989476336] [2022-11-20 12:14:09,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989476336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:09,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:09,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:14:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104416945] [2022-11-20 12:14:09,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:09,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:14:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:14:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:14:09,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 210 [2022-11-20 12:14:09,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 192 transitions, 405 flow. Second operand has 2 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 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-20 12:14:09,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:09,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 210 [2022-11-20 12:14:09,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:10,057 INFO L130 PetriNetUnfolder]: 51/864 cut-off events. [2022-11-20 12:14:10,057 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-20 12:14:10,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 864 events. 51/864 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5439 event pairs, 51 based on Foata normal form. 19/727 useless extension candidates. Maximal degree in co-relation 859. Up to 96 conditions per place. [2022-11-20 12:14:10,076 INFO L137 encePairwiseOnDemand]: 196/210 looper letters, 11 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2022-11-20 12:14:10,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 176 transitions, 395 flow [2022-11-20 12:14:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:14:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 12:14:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 389 transitions. [2022-11-20 12:14:10,102 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261904761904762 [2022-11-20 12:14:10,103 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 389 transitions. [2022-11-20 12:14:10,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 389 transitions. [2022-11-20 12:14:10,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:10,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 389 transitions. [2022-11-20 12:14:10,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 194.5) internal successors, (389), 2 states have internal predecessors, (389), 0 states have call successors, (0), 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-20 12:14:10,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 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-20 12:14:10,162 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 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-20 12:14:10,164 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 405 flow. Second operand 2 states and 389 transitions. [2022-11-20 12:14:10,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 176 transitions, 395 flow [2022-11-20 12:14:10,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 176 transitions, 382 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-20 12:14:10,188 INFO L231 Difference]: Finished difference. Result has 183 places, 176 transitions, 360 flow [2022-11-20 12:14:10,191 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=183, PETRI_TRANSITIONS=176} [2022-11-20 12:14:10,227 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -20 predicate places. [2022-11-20 12:14:10,227 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 176 transitions, 360 flow [2022-11-20 12:14:10,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 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-20 12:14:10,228 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:10,228 INFO L209 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] [2022-11-20 12:14:10,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:14:10,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1212378925, now seen corresponding path program 1 times [2022-11-20 12:14:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:10,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671347962] [2022-11-20 12:14:10,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:10,403 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-20 12:14:10,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:10,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671347962] [2022-11-20 12:14:10,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671347962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:10,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:10,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:14:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929426617] [2022-11-20 12:14:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:10,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:14:10,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:10,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:14:10,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:14:10,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2022-11-20 12:14:10,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-20 12:14:10,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:10,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2022-11-20 12:14:10,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:14,735 INFO L130 PetriNetUnfolder]: 8850/24455 cut-off events. [2022-11-20 12:14:14,735 INFO L131 PetriNetUnfolder]: For 368/368 co-relation queries the response was YES. [2022-11-20 12:14:14,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37721 conditions, 24455 events. 8850/24455 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 285329 event pairs, 6197 based on Foata normal form. 0/18888 useless extension candidates. Maximal degree in co-relation 37718. Up to 10013 conditions per place. [2022-11-20 12:14:15,025 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 46 selfloop transitions, 8 changer transitions 0/199 dead transitions. [2022-11-20 12:14:15,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 199 transitions, 518 flow [2022-11-20 12:14:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:14:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:14:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2022-11-20 12:14:15,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8587301587301587 [2022-11-20 12:14:15,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2022-11-20 12:14:15,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2022-11-20 12:14:15,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:15,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2022-11-20 12:14:15,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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-20 12:14:15,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:15,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:15,036 INFO L175 Difference]: Start difference. First operand has 183 places, 176 transitions, 360 flow. Second operand 3 states and 541 transitions. [2022-11-20 12:14:15,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 199 transitions, 518 flow [2022-11-20 12:14:15,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 199 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:14:15,043 INFO L231 Difference]: Finished difference. Result has 187 places, 183 transitions, 422 flow [2022-11-20 12:14:15,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2022-11-20 12:14:15,045 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -16 predicate places. [2022-11-20 12:14:15,045 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 422 flow [2022-11-20 12:14:15,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-20 12:14:15,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:15,046 INFO L209 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-20 12:14:15,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:14:15,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:15,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:15,049 INFO L85 PathProgramCache]: Analyzing trace with hash 875355591, now seen corresponding path program 1 times [2022-11-20 12:14:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:15,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541026195] [2022-11-20 12:14:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:15,175 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-20 12:14:15,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:15,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541026195] [2022-11-20 12:14:15,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541026195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:15,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:15,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:14:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813137216] [2022-11-20 12:14:15,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:15,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:14:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:15,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:14:15,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:14:15,181 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 210 [2022-11-20 12:14:15,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 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-20 12:14:15,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:15,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 210 [2022-11-20 12:14:15,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:20,188 INFO L130 PetriNetUnfolder]: 9634/34890 cut-off events. [2022-11-20 12:14:20,188 INFO L131 PetriNetUnfolder]: For 7356/8144 co-relation queries the response was YES. [2022-11-20 12:14:20,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57010 conditions, 34890 events. 9634/34890 cut-off events. For 7356/8144 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 476409 event pairs, 3650 based on Foata normal form. 19/28356 useless extension candidates. Maximal degree in co-relation 57005. Up to 7907 conditions per place. [2022-11-20 12:14:20,614 INFO L137 encePairwiseOnDemand]: 196/210 looper letters, 49 selfloop transitions, 15 changer transitions 0/212 dead transitions. [2022-11-20 12:14:20,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 212 transitions, 656 flow [2022-11-20 12:14:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:14:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:14:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2022-11-20 12:14:20,618 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8698412698412699 [2022-11-20 12:14:20,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2022-11-20 12:14:20,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2022-11-20 12:14:20,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:20,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2022-11-20 12:14:20,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 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-20 12:14:20,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:20,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:20,626 INFO L175 Difference]: Start difference. First operand has 187 places, 183 transitions, 422 flow. Second operand 3 states and 548 transitions. [2022-11-20 12:14:20,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 212 transitions, 656 flow [2022-11-20 12:14:20,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 212 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:14:20,723 INFO L231 Difference]: Finished difference. Result has 189 places, 198 transitions, 556 flow [2022-11-20 12:14:20,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=189, PETRI_TRANSITIONS=198} [2022-11-20 12:14:20,726 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -14 predicate places. [2022-11-20 12:14:20,726 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 198 transitions, 556 flow [2022-11-20 12:14:20,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 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-20 12:14:20,727 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:20,727 INFO L209 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-20 12:14:20,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:14:20,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash -36563742, now seen corresponding path program 1 times [2022-11-20 12:14:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:20,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068172988] [2022-11-20 12:14:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:20,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:20,806 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-20 12:14:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:20,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068172988] [2022-11-20 12:14:20,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068172988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:20,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:20,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:14:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803679477] [2022-11-20 12:14:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:14:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:14:20,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:14:20,811 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 210 [2022-11-20 12:14:20,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 198 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 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-20 12:14:20,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:20,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 210 [2022-11-20 12:14:20,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:23,537 INFO L130 PetriNetUnfolder]: 5215/21538 cut-off events. [2022-11-20 12:14:23,537 INFO L131 PetriNetUnfolder]: For 5079/7796 co-relation queries the response was YES. [2022-11-20 12:14:23,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36873 conditions, 21538 events. 5215/21538 cut-off events. For 5079/7796 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 289211 event pairs, 2031 based on Foata normal form. 26/17715 useless extension candidates. Maximal degree in co-relation 36867. Up to 3991 conditions per place. [2022-11-20 12:14:23,836 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 23 selfloop transitions, 7 changer transitions 0/209 dead transitions. [2022-11-20 12:14:23,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 209 transitions, 642 flow [2022-11-20 12:14:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:14:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:14:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2022-11-20 12:14:23,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2022-11-20 12:14:23,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2022-11-20 12:14:23,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2022-11-20 12:14:23,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:23,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2022-11-20 12:14:23,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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-20 12:14:23,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:23,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:23,845 INFO L175 Difference]: Start difference. First operand has 189 places, 198 transitions, 556 flow. Second operand 3 states and 553 transitions. [2022-11-20 12:14:23,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 209 transitions, 642 flow [2022-11-20 12:14:23,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 209 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:14:23,863 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 580 flow [2022-11-20 12:14:23,865 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2022-11-20 12:14:23,866 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -12 predicate places. [2022-11-20 12:14:23,867 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 580 flow [2022-11-20 12:14:23,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 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-20 12:14:23,872 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:23,872 INFO L209 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] [2022-11-20 12:14:23,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:14:23,872 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 160958644, now seen corresponding path program 1 times [2022-11-20 12:14:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:23,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89258320] [2022-11-20 12:14:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:24,234 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-20 12:14:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:24,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89258320] [2022-11-20 12:14:24,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89258320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:24,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:24,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:14:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997782906] [2022-11-20 12:14:24,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:24,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:14:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:14:24,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:14:24,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 210 [2022-11-20 12:14:24,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 580 flow. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 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-20 12:14:24,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:24,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 210 [2022-11-20 12:14:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:31,870 INFO L130 PetriNetUnfolder]: 14390/61555 cut-off events. [2022-11-20 12:14:31,871 INFO L131 PetriNetUnfolder]: For 10308/13436 co-relation queries the response was YES. [2022-11-20 12:14:32,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101272 conditions, 61555 events. 14390/61555 cut-off events. For 10308/13436 co-relation queries the response was YES. Maximal size of possible extension queue 2267. Compared 959245 event pairs, 3586 based on Foata normal form. 131/50257 useless extension candidates. Maximal degree in co-relation 101265. Up to 8673 conditions per place. [2022-11-20 12:14:32,716 INFO L137 encePairwiseOnDemand]: 200/210 looper letters, 37 selfloop transitions, 17 changer transitions 0/236 dead transitions. [2022-11-20 12:14:32,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 236 transitions, 789 flow [2022-11-20 12:14:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:14:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:14:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 921 transitions. [2022-11-20 12:14:32,720 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8771428571428571 [2022-11-20 12:14:32,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 921 transitions. [2022-11-20 12:14:32,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 921 transitions. [2022-11-20 12:14:32,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:32,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 921 transitions. [2022-11-20 12:14:32,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.2) internal successors, (921), 5 states have internal predecessors, (921), 0 states have call successors, (0), 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-20 12:14:32,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 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-20 12:14:32,728 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 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-20 12:14:32,728 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 580 flow. Second operand 5 states and 921 transitions. [2022-11-20 12:14:32,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 236 transitions, 789 flow [2022-11-20 12:14:32,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 236 transitions, 771 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:14:32,814 INFO L231 Difference]: Finished difference. Result has 196 places, 218 transitions, 689 flow [2022-11-20 12:14:32,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=689, PETRI_PLACES=196, PETRI_TRANSITIONS=218} [2022-11-20 12:14:32,817 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -7 predicate places. [2022-11-20 12:14:32,817 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 218 transitions, 689 flow [2022-11-20 12:14:32,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 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-20 12:14:32,818 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:32,819 INFO L209 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] [2022-11-20 12:14:32,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:14:32,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1699067936, now seen corresponding path program 2 times [2022-11-20 12:14:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:32,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976729563] [2022-11-20 12:14:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:33,064 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-20 12:14:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:33,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976729563] [2022-11-20 12:14:33,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976729563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:33,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:33,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:14:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477939742] [2022-11-20 12:14:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:33,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:14:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:33,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:14:33,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:14:33,069 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 210 [2022-11-20 12:14:33,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 218 transitions, 689 flow. Second operand has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 0 states have call successors, (0), 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-20 12:14:33,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:33,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 210 [2022-11-20 12:14:33,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:35,075 INFO L130 PetriNetUnfolder]: 2546/17795 cut-off events. [2022-11-20 12:14:35,076 INFO L131 PetriNetUnfolder]: For 4132/4910 co-relation queries the response was YES. [2022-11-20 12:14:35,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28094 conditions, 17795 events. 2546/17795 cut-off events. For 4132/4910 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 250261 event pairs, 770 based on Foata normal form. 123/14512 useless extension candidates. Maximal degree in co-relation 28085. Up to 2594 conditions per place. [2022-11-20 12:14:35,267 INFO L137 encePairwiseOnDemand]: 203/210 looper letters, 18 selfloop transitions, 8 changer transitions 0/213 dead transitions. [2022-11-20 12:14:35,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 213 transitions, 699 flow [2022-11-20 12:14:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:14:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:14:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 739 transitions. [2022-11-20 12:14:35,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8797619047619047 [2022-11-20 12:14:35,270 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 739 transitions. [2022-11-20 12:14:35,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 739 transitions. [2022-11-20 12:14:35,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:35,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 739 transitions. [2022-11-20 12:14:35,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 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-20 12:14:35,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 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-20 12:14:35,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 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-20 12:14:35,276 INFO L175 Difference]: Start difference. First operand has 196 places, 218 transitions, 689 flow. Second operand 4 states and 739 transitions. [2022-11-20 12:14:35,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 213 transitions, 699 flow [2022-11-20 12:14:35,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 213 transitions, 685 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-20 12:14:35,285 INFO L231 Difference]: Finished difference. Result has 198 places, 208 transitions, 633 flow [2022-11-20 12:14:35,285 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=633, PETRI_PLACES=198, PETRI_TRANSITIONS=208} [2022-11-20 12:14:35,286 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -5 predicate places. [2022-11-20 12:14:35,286 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 208 transitions, 633 flow [2022-11-20 12:14:35,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 0 states have call successors, (0), 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-20 12:14:35,287 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:35,287 INFO L209 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] [2022-11-20 12:14:35,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:14:35,288 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:35,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:35,288 INFO L85 PathProgramCache]: Analyzing trace with hash 330204001, now seen corresponding path program 1 times [2022-11-20 12:14:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:35,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182415815] [2022-11-20 12:14:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:35,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:35,320 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-20 12:14:35,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:35,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182415815] [2022-11-20 12:14:35,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182415815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:35,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:35,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:14:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838747812] [2022-11-20 12:14:35,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:35,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:14:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:35,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:14:35,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:14:35,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2022-11-20 12:14:35,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 208 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 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-20 12:14:35,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:35,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2022-11-20 12:14:35,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:40,345 INFO L130 PetriNetUnfolder]: 9775/42347 cut-off events. [2022-11-20 12:14:40,345 INFO L131 PetriNetUnfolder]: For 21708/22888 co-relation queries the response was YES. [2022-11-20 12:14:40,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76789 conditions, 42347 events. 9775/42347 cut-off events. For 21708/22888 co-relation queries the response was YES. Maximal size of possible extension queue 1870. Compared 643892 event pairs, 4724 based on Foata normal form. 53/34020 useless extension candidates. Maximal degree in co-relation 76780. Up to 10302 conditions per place. [2022-11-20 12:14:40,820 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 43 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2022-11-20 12:14:40,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 224 transitions, 791 flow [2022-11-20 12:14:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:14:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:14:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2022-11-20 12:14:40,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8634920634920635 [2022-11-20 12:14:40,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2022-11-20 12:14:40,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2022-11-20 12:14:40,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:40,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2022-11-20 12:14:40,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 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-20 12:14:40,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:40,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:40,828 INFO L175 Difference]: Start difference. First operand has 198 places, 208 transitions, 633 flow. Second operand 3 states and 544 transitions. [2022-11-20 12:14:40,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 224 transitions, 791 flow [2022-11-20 12:14:40,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 224 transitions, 769 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:14:40,845 INFO L231 Difference]: Finished difference. Result has 199 places, 212 transitions, 655 flow [2022-11-20 12:14:40,846 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=199, PETRI_TRANSITIONS=212} [2022-11-20 12:14:40,846 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -4 predicate places. [2022-11-20 12:14:40,847 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 212 transitions, 655 flow [2022-11-20 12:14:40,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 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-20 12:14:40,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:40,847 INFO L209 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] [2022-11-20 12:14:40,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:14:40,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1673146552, now seen corresponding path program 1 times [2022-11-20 12:14:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:40,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887406108] [2022-11-20 12:14:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:40,886 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-20 12:14:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:40,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887406108] [2022-11-20 12:14:40,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887406108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:40,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:40,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:14:40,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824081189] [2022-11-20 12:14:40,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:40,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:14:40,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:14:40,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:14:40,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2022-11-20 12:14:40,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 212 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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-20 12:14:40,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:40,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2022-11-20 12:14:40,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:46,672 INFO L130 PetriNetUnfolder]: 10532/49254 cut-off events. [2022-11-20 12:14:46,672 INFO L131 PetriNetUnfolder]: For 18871/27010 co-relation queries the response was YES. [2022-11-20 12:14:46,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90909 conditions, 49254 events. 10532/49254 cut-off events. For 18871/27010 co-relation queries the response was YES. Maximal size of possible extension queue 2057. Compared 773344 event pairs, 4332 based on Foata normal form. 95/40353 useless extension candidates. Maximal degree in co-relation 90899. Up to 12178 conditions per place. [2022-11-20 12:14:47,413 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 70 selfloop transitions, 12 changer transitions 0/237 dead transitions. [2022-11-20 12:14:47,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 237 transitions, 929 flow [2022-11-20 12:14:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:14:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:14:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-11-20 12:14:47,416 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2022-11-20 12:14:47,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2022-11-20 12:14:47,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2022-11-20 12:14:47,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:47,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2022-11-20 12:14:47,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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-20 12:14:47,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:47,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:47,422 INFO L175 Difference]: Start difference. First operand has 199 places, 212 transitions, 655 flow. Second operand 3 states and 535 transitions. [2022-11-20 12:14:47,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 237 transitions, 929 flow [2022-11-20 12:14:47,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 237 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:14:47,508 INFO L231 Difference]: Finished difference. Result has 201 places, 222 transitions, 767 flow [2022-11-20 12:14:47,508 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=201, PETRI_TRANSITIONS=222} [2022-11-20 12:14:47,509 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -2 predicate places. [2022-11-20 12:14:47,509 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 222 transitions, 767 flow [2022-11-20 12:14:47,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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-20 12:14:47,510 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:47,510 INFO L209 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] [2022-11-20 12:14:47,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:14:47,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr5ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:47,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1632741772, now seen corresponding path program 1 times [2022-11-20 12:14:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:47,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469535186] [2022-11-20 12:14:47,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:47,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:14:47,546 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-20 12:14:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:14:47,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469535186] [2022-11-20 12:14:47,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469535186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:14:47,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:14:47,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:14:47,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598921957] [2022-11-20 12:14:47,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:14:47,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:14:47,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:14:47,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:14:47,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:14:47,550 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 210 [2022-11-20 12:14:47,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 222 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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-20 12:14:47,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:14:47,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 210 [2022-11-20 12:14:47,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:14:51,462 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [132#L700-1true, 224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 48#L699-3true, Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:51,462 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-20 12:14:51,463 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-20 12:14:51,463 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-20 12:14:51,463 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-20 12:14:51,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][217], [37#L699-3true, 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 79#L708-3true, 43#L700-1true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:51,532 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-20 12:14:51,533 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-20 12:14:51,533 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-20 12:14:51,533 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-20 12:14:52,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [42#L700-3true, 224#true, 79#L708-3true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, 48#L699-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,218 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-20 12:14:52,218 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:14:52,218 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:14:52,218 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:14:52,274 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [132#L700-1true, 224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 153#L700true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,274 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-20 12:14:52,274 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-20 12:14:52,275 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-20 12:14:52,275 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-20 12:14:52,305 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 43#L700-1true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 21#L700true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,305 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-20 12:14:52,305 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-20 12:14:52,305 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-20 12:14:52,305 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-20 12:14:52,343 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][217], [37#L699-3true, 224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, 27#L700-3true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,343 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-20 12:14:52,344 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:14:52,344 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:14:52,344 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-20 12:14:52,408 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [224#true, 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 48#L699-3true, Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,408 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,408 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,408 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,408 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,462 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [170#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, 224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 48#L699-3true, Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,462 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,462 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,463 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,463 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 12#L701true, 123#L718-4true, 48#L699-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,664 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,664 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,664 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,664 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,712 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [42#L700-3true, 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 153#L700true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,712 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,712 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,712 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,712 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,797 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, 27#L700-3true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, 21#L700true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,797 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,798 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,798 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,798 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 12:14:52,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 79#L708-3true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 153#L700true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,886 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,886 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,886 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,886 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,912 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [170#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, 224#true, 79#L708-3true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 153#L700true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:52,913 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,913 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,913 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:52,913 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:14:53,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 79#L708-3true, 153#L700true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 12#L701true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:53,058 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-20 12:14:53,058 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-20 12:14:53,058 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-20 12:14:53,058 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-20 12:14:54,596 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [224#true, 79#L708-3true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, 182#L719-7true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 48#L699-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:54,596 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-11-20 12:14:54,596 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-20 12:14:54,596 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-20 12:14:54,596 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-20 12:14:54,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 153#L700true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, 182#L719-7true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-20 12:14:54,722 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-20 12:14:54,722 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-20 12:14:54,722 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-20 12:14:54,722 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-20 12:14:55,626 INFO L130 PetriNetUnfolder]: 12350/60141 cut-off events. [2022-11-20 12:14:55,627 INFO L131 PetriNetUnfolder]: For 36678/39809 co-relation queries the response was YES. [2022-11-20 12:14:56,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116087 conditions, 60141 events. 12350/60141 cut-off events. For 36678/39809 co-relation queries the response was YES. Maximal size of possible extension queue 2827. Compared 986707 event pairs, 3588 based on Foata normal form. 312/50242 useless extension candidates. Maximal degree in co-relation 116076. Up to 7734 conditions per place. [2022-11-20 12:14:56,403 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 49 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2022-11-20 12:14:56,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 245 transitions, 973 flow [2022-11-20 12:14:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:14:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:14:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2022-11-20 12:14:56,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8793650793650793 [2022-11-20 12:14:56,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2022-11-20 12:14:56,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2022-11-20 12:14:56,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:14:56,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2022-11-20 12:14:56,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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-20 12:14:56,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:56,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 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-20 12:14:56,413 INFO L175 Difference]: Start difference. First operand has 201 places, 222 transitions, 767 flow. Second operand 3 states and 554 transitions. [2022-11-20 12:14:56,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 245 transitions, 973 flow [2022-11-20 12:14:56,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 245 transitions, 933 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-20 12:14:56,607 INFO L231 Difference]: Finished difference. Result has 203 places, 228 transitions, 789 flow [2022-11-20 12:14:56,608 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=203, PETRI_TRANSITIONS=228} [2022-11-20 12:14:56,608 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, 0 predicate places. [2022-11-20 12:14:56,609 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 228 transitions, 789 flow [2022-11-20 12:14:56,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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-20 12:14:56,609 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:14:56,610 INFO L209 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] [2022-11-20 12:14:56,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:14:56,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 12:14:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:14:56,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1801537285, now seen corresponding path program 1 times [2022-11-20 12:14:56,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:14:56,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393810696] [2022-11-20 12:14:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:14:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:14:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:14:56,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:14:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:14:56,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:14:56,670 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:14:56,672 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writerErr4ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2022-11-20 12:14:56,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2022-11-20 12:14:56,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2022-11-20 12:14:56,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2022-11-20 12:14:56,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2022-11-20 12:14:56,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2022-11-20 12:14:56,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2022-11-20 12:14:56,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2022-11-20 12:14:56,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2022-11-20 12:14:56,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2022-11-20 12:14:56,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2022-11-20 12:14:56,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2022-11-20 12:14:56,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2022-11-20 12:14:56,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2022-11-20 12:14:56,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 50 remaining) [2022-11-20 12:14:56,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 50 remaining) [2022-11-20 12:14:56,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 50 remaining) [2022-11-20 12:14:56,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 50 remaining) [2022-11-20 12:14:56,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2022-11-20 12:14:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2022-11-20 12:14:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2022-11-20 12:14:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2022-11-20 12:14:56,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2022-11-20 12:14:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2022-11-20 12:14:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2022-11-20 12:14:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2022-11-20 12:14:56,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2022-11-20 12:14:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2022-11-20 12:14:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2022-11-20 12:14:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2022-11-20 12:14:56,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2022-11-20 12:14:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2022-11-20 12:14:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2022-11-20 12:14:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2022-11-20 12:14:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2022-11-20 12:14:56,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2022-11-20 12:14:56,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2022-11-20 12:14:56,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2022-11-20 12:14:56,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2022-11-20 12:14:56,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2022-11-20 12:14:56,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2022-11-20 12:14:56,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2022-11-20 12:14:56,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2022-11-20 12:14:56,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2022-11-20 12:14:56,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2022-11-20 12:14:56,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2022-11-20 12:14:56,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2022-11-20 12:14:56,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2022-11-20 12:14:56,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2022-11-20 12:14:56,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2022-11-20 12:14:56,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:14:56,700 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:14:56,709 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:14:56,710 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:14:56,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:14:56 BasicIcfg [2022-11-20 12:14:56,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:14:56,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:14:56,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:14:56,765 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:14:56,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:14:08" (3/4) ... [2022-11-20 12:14:56,768 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:14:56,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:14:56,769 INFO L158 Benchmark]: Toolchain (without parser) took 49590.95ms. Allocated memory was 132.1MB in the beginning and 14.1GB in the end (delta: 14.0GB). Free memory was 72.0MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-11-20 12:14:56,769 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:14:56,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.29ms. Allocated memory was 132.1MB in the beginning and 199.2MB in the end (delta: 67.1MB). Free memory was 71.8MB in the beginning and 158.4MB in the end (delta: -86.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-11-20 12:14:56,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.52ms. Allocated memory is still 199.2MB. Free memory was 158.4MB in the beginning and 156.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:14:56,771 INFO L158 Benchmark]: Boogie Preprocessor took 34.71ms. Allocated memory is still 199.2MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:14:56,771 INFO L158 Benchmark]: RCFGBuilder took 823.58ms. Allocated memory is still 199.2MB. Free memory was 154.2MB in the beginning and 128.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 12:14:56,771 INFO L158 Benchmark]: TraceAbstraction took 47920.38ms. Allocated memory was 199.2MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 127.9MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-20 12:14:56,772 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 14.1GB. Free memory was 11.6GB in the beginning and 11.6GB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:14:56,774 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.24ms. Allocated memory is still 132.1MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.29ms. Allocated memory was 132.1MB in the beginning and 199.2MB in the end (delta: 67.1MB). Free memory was 71.8MB in the beginning and 158.4MB in the end (delta: -86.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.52ms. Allocated memory is still 199.2MB. Free memory was 158.4MB in the beginning and 156.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.71ms. Allocated memory is still 199.2MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 823.58ms. Allocated memory is still 199.2MB. Free memory was 154.2MB in the beginning and 128.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 47920.38ms. Allocated memory was 199.2MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 127.9MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 14.1GB. Free memory was 11.6GB in the beginning and 11.6GB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 700]: Data race detected Data race detected The following path leads to a data race: [L688] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L714] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L715] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-1, r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L716] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=0, r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L698] CALL 1 __VERIFIER_atomic_take_write_lock() [L690] EXPR 1 w==0 [L690] EXPR 1 w==0 && r==0 [L690] EXPR 1 r==0 [L690] EXPR 1 w==0 && r==0 [L690] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L690] RET 1 assume_abort_if_not(w==0 && r==0) [L691] 1 w = 1 [L698] RET 1 __VERIFIER_atomic_take_write_lock() [L699] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L700] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=0, w=0, w = 0=50, x=3, y=0] [L704] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=3, y=0] [L705] CALL 2 __VERIFIER_atomic_take_read_lock() [L694] EXPR 2 w==0 [L694] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L694] RET 2 assume_abort_if_not(w==0) [L695] EXPR 2 r+1 [L695] 2 r = r+1 [L705] RET 2 __VERIFIER_atomic_take_read_lock() [L700] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=1, w=0, w = 0=50, x=3, y=0] Now there is a data race on ~w~0 between C: w==0 [694] and C: w = 0 [700] - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 271 locations, 50 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: 47.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 45.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 107 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=789occurred in iteration=9, InterpolantAutomatonStates: 29, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-20 12:14:56,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410f4036-124d-4443-89dd-c3c0be6d73ba/bin/uautomizer-ug76WZFUDN/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE