./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8 --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 e74a9d887f2b5ed1ee32deb282db19752d3db312511ed38f97d9f22bdf2fecb9 --- 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-e04fb08 [2022-11-16 11:09:37,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:09:37,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:09:37,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:09:37,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:09:37,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:09:37,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:09:37,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:09:37,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:09:37,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:09:37,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:09:37,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:09:37,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:09:37,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:09:37,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:09:37,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:09:37,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:09:37,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:09:37,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:09:37,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:09:37,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:09:37,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:09:37,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:09:37,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:09:37,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:09:37,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:09:37,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:09:37,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:09:37,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:09:37,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:09:37,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:09:37,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:09:37,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:09:37,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:09:37,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:09:37,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:09:37,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:09:37,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:09:37,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:09:37,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:09:37,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:09:37,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 11:09:37,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:09:37,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:09:37,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:09:37,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:09:37,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:09:37,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:09:37,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:09:37,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:09:37,380 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:09:37,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:09:37,381 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:09:37,381 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:09:37,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:09:37,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:09:37,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:09:37,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:09:37,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:09:37,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:09:37,384 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 11:09:37,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:09:37,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:09:37,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:09:37,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:09:37,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:09:37,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:09:37,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:09:37,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:09:37,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:09:37,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:09:37,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:09:37,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:09:37,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:09:37,389 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:09:37,389 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:09:37,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:09:37,390 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_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/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_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8 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 -> e74a9d887f2b5ed1ee32deb282db19752d3db312511ed38f97d9f22bdf2fecb9 [2022-11-16 11:09:37,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:09:37,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:09:37,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:09:37,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:09:37,866 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:09:37,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2022-11-16 11:09:37,967 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/data/098e2686d/4ba06362836c447496353297dbbce0a5/FLAGa53b10d60 [2022-11-16 11:09:38,662 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:09:38,668 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2022-11-16 11:09:38,696 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/data/098e2686d/4ba06362836c447496353297dbbce0a5/FLAGa53b10d60 [2022-11-16 11:09:38,925 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/data/098e2686d/4ba06362836c447496353297dbbce0a5 [2022-11-16 11:09:38,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:09:38,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:09:38,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:09:38,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:09:38,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:09:38,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:09:38" (1/1) ... [2022-11-16 11:09:38,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e31bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:38, skipping insertion in model container [2022-11-16 11:09:38,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:09:38" (1/1) ... [2022-11-16 11:09:38,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:09:39,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:09:39,629 WARN L229 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_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i[30416,30429] [2022-11-16 11:09:39,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:09:39,649 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:09:39,702 WARN L229 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_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i[30416,30429] [2022-11-16 11:09:39,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:09:39,754 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:09:39,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39 WrapperNode [2022-11-16 11:09:39,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:09:39,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:09:39,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:09:39,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:09:39,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,868 INFO L138 Inliner]: procedures = 171, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 167 [2022-11-16 11:09:39,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:09:39,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:09:39,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:09:39,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:09:39,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,902 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:09:39,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:09:39,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:09:39,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:09:39,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (1/1) ... [2022-11-16 11:09:39,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:09:39,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:09:39,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:09:39,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:09:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:09:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:09:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:09:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-16 11:09:40,001 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-16 11:09:40,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:09:40,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:09:40,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:09:40,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:09:40,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:09:40,005 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-16 11:09:40,005 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-16 11:09:40,007 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:09:40,254 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:09:40,257 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:09:40,730 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:09:40,974 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:09:40,974 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:09:40,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:09:40 BoogieIcfgContainer [2022-11-16 11:09:40,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:09:40,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:09:40,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:09:41,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:09:41,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:09:38" (1/3) ... [2022-11-16 11:09:41,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a8a0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:09:41, skipping insertion in model container [2022-11-16 11:09:41,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:09:39" (2/3) ... [2022-11-16 11:09:41,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a8a0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:09:41, skipping insertion in model container [2022-11-16 11:09:41,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:09:40" (3/3) ... [2022-11-16 11:09:41,014 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1b.i [2022-11-16 11:09:41,049 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:09:41,067 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:09:41,067 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-16 11:09:41,067 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:09:41,253 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-16 11:09:41,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 196 transitions, 424 flow [2022-11-16 11:09:41,427 INFO L130 PetriNetUnfolder]: 2/192 cut-off events. [2022-11-16 11:09:41,433 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 11:09:41,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 192 events. 2/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 358 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2022-11-16 11:09:41,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 196 transitions, 424 flow [2022-11-16 11:09:41,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 178 transitions, 377 flow [2022-11-16 11:09:41,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:09:41,486 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;@2962429f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:09:41,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-16 11:09:41,497 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-16 11:09:41,497 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:09:41,498 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:09:41,498 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-16 11:09:41,499 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-16 11:09:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash 842558235, now seen corresponding path program 1 times [2022-11-16 11:09:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148508051] [2022-11-16 11:09:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:41,785 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-16 11:09:41,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:41,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148508051] [2022-11-16 11:09:41,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148508051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:41,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:41,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:09:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831610178] [2022-11-16 11:09:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:41,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:09:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:09:41,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:09:41,870 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 196 [2022-11-16 11:09:41,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 178 transitions, 377 flow. Second operand has 2 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 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-16 11:09:41,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:09:41,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 196 [2022-11-16 11:09:41,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:09:42,362 INFO L130 PetriNetUnfolder]: 119/1187 cut-off events. [2022-11-16 11:09:42,363 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-11-16 11:09:42,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 1187 events. 119/1187 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8202 event pairs, 119 based on Foata normal form. 28/1008 useless extension candidates. Maximal degree in co-relation 1267. Up to 203 conditions per place. [2022-11-16 11:09:42,387 INFO L137 encePairwiseOnDemand]: 178/196 looper letters, 13 selfloop transitions, 0 changer transitions 0/158 dead transitions. [2022-11-16 11:09:42,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 158 transitions, 363 flow [2022-11-16 11:09:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:09:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:09:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2022-11-16 11:09:42,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9056122448979592 [2022-11-16 11:09:42,420 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 355 transitions. [2022-11-16 11:09:42,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 355 transitions. [2022-11-16 11:09:42,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:09:42,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 355 transitions. [2022-11-16 11:09:42,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 177.5) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 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-16 11:09:42,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 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-16 11:09:42,443 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 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-16 11:09:42,445 INFO L175 Difference]: Start difference. First operand has 189 places, 178 transitions, 377 flow. Second operand 2 states and 355 transitions. [2022-11-16 11:09:42,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 158 transitions, 363 flow [2022-11-16 11:09:42,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 158 transitions, 350 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 11:09:42,462 INFO L231 Difference]: Finished difference. Result has 165 places, 158 transitions, 324 flow [2022-11-16 11:09:42,465 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=324, PETRI_PLACES=165, PETRI_TRANSITIONS=158} [2022-11-16 11:09:42,473 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -24 predicate places. [2022-11-16 11:09:42,474 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 158 transitions, 324 flow [2022-11-16 11:09:42,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 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-16 11:09:42,475 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:09:42,475 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-16 11:09:42,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:09:42,476 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-16 11:09:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1016769568, now seen corresponding path program 1 times [2022-11-16 11:09:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:42,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846487884] [2022-11-16 11:09:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:42,699 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-16 11:09:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846487884] [2022-11-16 11:09:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846487884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:42,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:42,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:09:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709588035] [2022-11-16 11:09:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:42,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:09:42,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:09:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:09:42,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 196 [2022-11-16 11:09:42,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 158 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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-16 11:09:42,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:09:42,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 196 [2022-11-16 11:09:42,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:09:48,147 INFO L130 PetriNetUnfolder]: 11193/23638 cut-off events. [2022-11-16 11:09:48,148 INFO L131 PetriNetUnfolder]: For 459/459 co-relation queries the response was YES. [2022-11-16 11:09:48,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40256 conditions, 23638 events. 11193/23638 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 239162 event pairs, 7860 based on Foata normal form. 0/18379 useless extension candidates. Maximal degree in co-relation 40253. Up to 12581 conditions per place. [2022-11-16 11:09:48,531 INFO L137 encePairwiseOnDemand]: 187/196 looper letters, 50 selfloop transitions, 8 changer transitions 0/183 dead transitions. [2022-11-16 11:09:48,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 183 transitions, 494 flow [2022-11-16 11:09:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:09:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:09:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-11-16 11:09:48,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248299319727891 [2022-11-16 11:09:48,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2022-11-16 11:09:48,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2022-11-16 11:09:48,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:09:48,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2022-11-16 11:09:48,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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-16 11:09:48,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:09:48,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:09:48,546 INFO L175 Difference]: Start difference. First operand has 165 places, 158 transitions, 324 flow. Second operand 3 states and 485 transitions. [2022-11-16 11:09:48,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 183 transitions, 494 flow [2022-11-16 11:09:48,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 183 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:09:48,559 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 386 flow [2022-11-16 11:09:48,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2022-11-16 11:09:48,561 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -20 predicate places. [2022-11-16 11:09:48,562 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 386 flow [2022-11-16 11:09:48,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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-16 11:09:48,563 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:09:48,563 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-16 11:09:48,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:09:48,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 11:09:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1778422134, now seen corresponding path program 1 times [2022-11-16 11:09:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:48,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144870572] [2022-11-16 11:09:48,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:48,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:48,726 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-16 11:09:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:48,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144870572] [2022-11-16 11:09:48,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144870572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:48,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:48,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:09:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067382950] [2022-11-16 11:09:48,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:48,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:09:48,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:48,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:09:48,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:09:48,732 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2022-11-16 11:09:48,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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-16 11:09:48,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:09:48,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2022-11-16 11:09:48,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:09:50,668 INFO L130 PetriNetUnfolder]: 2763/9036 cut-off events. [2022-11-16 11:09:50,668 INFO L131 PetriNetUnfolder]: For 299/337 co-relation queries the response was YES. [2022-11-16 11:09:50,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14270 conditions, 9036 events. 2763/9036 cut-off events. For 299/337 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 96389 event pairs, 1892 based on Foata normal form. 0/6964 useless extension candidates. Maximal degree in co-relation 14265. Up to 2812 conditions per place. [2022-11-16 11:09:50,800 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 27 selfloop transitions, 7 changer transitions 0/178 dead transitions. [2022-11-16 11:09:50,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 178 transitions, 484 flow [2022-11-16 11:09:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:09:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:09:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-11-16 11:09:50,804 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2022-11-16 11:09:50,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-11-16 11:09:50,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-11-16 11:09:50,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:09:50,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-11-16 11:09:50,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-16 11:09:50,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:09:50,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:09:50,812 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 386 flow. Second operand 3 states and 497 transitions. [2022-11-16 11:09:50,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 178 transitions, 484 flow [2022-11-16 11:09:50,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 178 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:09:50,829 INFO L231 Difference]: Finished difference. Result has 171 places, 171 transitions, 424 flow [2022-11-16 11:09:50,830 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=171, PETRI_TRANSITIONS=171} [2022-11-16 11:09:50,833 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -18 predicate places. [2022-11-16 11:09:50,833 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 171 transitions, 424 flow [2022-11-16 11:09:50,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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-16 11:09:50,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:09:50,835 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-16 11:09:50,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:09:50,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 11:09:50,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1739064756, now seen corresponding path program 1 times [2022-11-16 11:09:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:50,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831465352] [2022-11-16 11:09:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:50,935 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-16 11:09:50,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:50,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831465352] [2022-11-16 11:09:50,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831465352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:50,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:50,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:09:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798481837] [2022-11-16 11:09:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:50,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:09:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:09:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:09:50,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2022-11-16 11:09:50,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 171 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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-16 11:09:50,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:09:50,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2022-11-16 11:09:50,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:09:59,976 INFO L130 PetriNetUnfolder]: 19347/52753 cut-off events. [2022-11-16 11:09:59,977 INFO L131 PetriNetUnfolder]: For 12396/15297 co-relation queries the response was YES. [2022-11-16 11:10:00,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98547 conditions, 52753 events. 19347/52753 cut-off events. For 12396/15297 co-relation queries the response was YES. Maximal size of possible extension queue 2059. Compared 690170 event pairs, 6362 based on Foata normal form. 32/42412 useless extension candidates. Maximal degree in co-relation 98541. Up to 16207 conditions per place. [2022-11-16 11:10:00,629 INFO L137 encePairwiseOnDemand]: 182/196 looper letters, 59 selfloop transitions, 15 changer transitions 0/205 dead transitions. [2022-11-16 11:10:00,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 205 transitions, 692 flow [2022-11-16 11:10:00,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:10:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2022-11-16 11:10:00,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2022-11-16 11:10:00,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2022-11-16 11:10:00,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2022-11-16 11:10:00,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:10:00,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2022-11-16 11:10:00,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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-16 11:10:00,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:00,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:00,642 INFO L175 Difference]: Start difference. First operand has 171 places, 171 transitions, 424 flow. Second operand 3 states and 492 transitions. [2022-11-16 11:10:00,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 205 transitions, 692 flow [2022-11-16 11:10:00,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 205 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:10:00,712 INFO L231 Difference]: Finished difference. Result has 173 places, 186 transitions, 560 flow [2022-11-16 11:10:00,713 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=173, PETRI_TRANSITIONS=186} [2022-11-16 11:10:00,714 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -16 predicate places. [2022-11-16 11:10:00,715 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 186 transitions, 560 flow [2022-11-16 11:10:00,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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-16 11:10:00,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:10:00,719 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-16 11:10:00,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:10:00,720 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-16 11:10:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1112516969, now seen corresponding path program 1 times [2022-11-16 11:10:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:00,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719479312] [2022-11-16 11:10:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:01,397 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-16 11:10:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:01,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719479312] [2022-11-16 11:10:01,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719479312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:01,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:01,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605725588] [2022-11-16 11:10:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:01,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:10:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:10:01,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:01,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 196 [2022-11-16 11:10:01,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 186 transitions, 560 flow. Second operand has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 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-16 11:10:01,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:10:01,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 196 [2022-11-16 11:10:01,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:10:07,400 INFO L130 PetriNetUnfolder]: 7976/39491 cut-off events. [2022-11-16 11:10:07,400 INFO L131 PetriNetUnfolder]: For 10700/15455 co-relation queries the response was YES. [2022-11-16 11:10:07,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66626 conditions, 39491 events. 7976/39491 cut-off events. For 10700/15455 co-relation queries the response was YES. Maximal size of possible extension queue 1621. Compared 602426 event pairs, 1502 based on Foata normal form. 444/33680 useless extension candidates. Maximal degree in co-relation 66619. Up to 5407 conditions per place. [2022-11-16 11:10:07,870 INFO L137 encePairwiseOnDemand]: 186/196 looper letters, 40 selfloop transitions, 24 changer transitions 0/230 dead transitions. [2022-11-16 11:10:07,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 230 transitions, 824 flow [2022-11-16 11:10:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:10:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:10:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 846 transitions. [2022-11-16 11:10:07,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.863265306122449 [2022-11-16 11:10:07,874 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 846 transitions. [2022-11-16 11:10:07,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 846 transitions. [2022-11-16 11:10:07,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:10:07,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 846 transitions. [2022-11-16 11:10:07,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.2) internal successors, (846), 5 states have internal predecessors, (846), 0 states have call successors, (0), 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-16 11:10:07,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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-16 11:10:07,881 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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-16 11:10:07,882 INFO L175 Difference]: Start difference. First operand has 173 places, 186 transitions, 560 flow. Second operand 5 states and 846 transitions. [2022-11-16 11:10:07,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 230 transitions, 824 flow [2022-11-16 11:10:07,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 230 transitions, 794 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:10:07,912 INFO L231 Difference]: Finished difference. Result has 177 places, 207 transitions, 698 flow [2022-11-16 11:10:07,913 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=698, PETRI_PLACES=177, PETRI_TRANSITIONS=207} [2022-11-16 11:10:07,917 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -12 predicate places. [2022-11-16 11:10:07,917 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 207 transitions, 698 flow [2022-11-16 11:10:07,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 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-16 11:10:07,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:10:07,919 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-16 11:10:07,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:10:07,919 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-16 11:10:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1550551509, now seen corresponding path program 2 times [2022-11-16 11:10:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:07,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828256099] [2022-11-16 11:10:07,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:07,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:08,331 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-16 11:10:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:08,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828256099] [2022-11-16 11:10:08,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828256099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:08,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:08,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:08,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479530573] [2022-11-16 11:10:08,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:08,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:08,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:08,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:08,335 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 196 [2022-11-16 11:10:08,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 207 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 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-16 11:10:08,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:10:08,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 196 [2022-11-16 11:10:08,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:10:09,067 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L702-1-->L702-2: Formula: (= |v_writerThread1of1ForFork2_#t~nondet7#1_3| |v_#race~x~0_7|) InVars {writerThread1of1ForFork2_#t~nondet7#1=|v_writerThread1of1ForFork2_#t~nondet7#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork2_#t~nondet7#1=|v_writerThread1of1ForFork2_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~x~0][139], [Black: 227#(= |#race~x~0| 0), 233#(= ~r~0 0), 70#L709-1true, 41#L720-4true, 210#true, 53#L702-2true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, 241#(not (= ~w~0 0)), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 98#L703-4true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:09,068 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is not cut-off event [2022-11-16 11:10:09,068 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:09,068 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:09,068 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:09,362 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([456] L711-8-->L712-1: Formula: (= v_~r~0_72 (+ v_~r~0_71 1)) InVars {~r~0=v_~r~0_72} OutVars{readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1=|v_readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1_5|, #race~r~0=|v_#race~r~0_100|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1, #race~r~0, ~r~0][171], [Black: 225#true, 32#L712-1true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 233#(= ~r~0 0), Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, 231#true, 241#(not (= ~w~0 0)), 165#L701-2true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 98#L703-4true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:09,362 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is not cut-off event [2022-11-16 11:10:09,363 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2022-11-16 11:10:09,363 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2022-11-16 11:10:09,363 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2022-11-16 11:10:09,389 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L702-1-->L702-2: Formula: (= |v_writerThread1of1ForFork2_#t~nondet7#1_3| |v_#race~x~0_7|) InVars {writerThread1of1ForFork2_#t~nondet7#1=|v_writerThread1of1ForFork2_#t~nondet7#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork2_#t~nondet7#1=|v_writerThread1of1ForFork2_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~x~0][139], [Black: 227#(= |#race~x~0| 0), 233#(= ~r~0 0), 41#L720-4true, 210#true, 53#L702-2true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 34#L711-4true, 61#L712-1true, 241#(not (= ~w~0 0)), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 98#L703-4true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:09,389 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is not cut-off event [2022-11-16 11:10:09,389 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-16 11:10:09,389 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-16 11:10:09,389 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-16 11:10:09,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([456] L711-8-->L712-1: Formula: (= v_~r~0_72 (+ v_~r~0_71 1)) InVars {~r~0=v_~r~0_72} OutVars{readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1=|v_readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1_5|, #race~r~0=|v_#race~r~0_100|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1, #race~r~0, ~r~0][171], [Black: 225#true, 32#L712-1true, 210#true, readerThread1of1ForFork0InUse, Black: 233#(= ~r~0 0), Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, 231#true, 241#(not (= ~w~0 0)), 165#L701-2true, 96#L721-7true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:09,541 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-16 11:10:09,541 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-16 11:10:09,541 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-16 11:10:09,541 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-16 11:10:09,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([456] L711-8-->L712-1: Formula: (= v_~r~0_72 (+ v_~r~0_71 1)) InVars {~r~0=v_~r~0_72} OutVars{readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1=|v_readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1_5|, #race~r~0=|v_#race~r~0_100|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0___VERIFIER_atomic_release_read_lock_#t~nondet6#1, #race~r~0, ~r~0][171], [Black: 225#true, 231#true, 32#L712-1true, 241#(not (= ~w~0 0)), 165#L701-2true, 210#true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 82#L722-7true, readerThread1of1ForFork0InUse, Black: 233#(= ~r~0 0), Black: 234#(and (= ~r~0 0) (= ~w~0 0)), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:09,620 INFO L383 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-11-16 11:10:09,620 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 11:10:09,620 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 11:10:09,620 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 11:10:09,663 INFO L130 PetriNetUnfolder]: 1425/8869 cut-off events. [2022-11-16 11:10:09,663 INFO L131 PetriNetUnfolder]: For 3681/4010 co-relation queries the response was YES. [2022-11-16 11:10:09,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15599 conditions, 8869 events. 1425/8869 cut-off events. For 3681/4010 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 106628 event pairs, 432 based on Foata normal form. 148/7634 useless extension candidates. Maximal degree in co-relation 15590. Up to 1189 conditions per place. [2022-11-16 11:10:09,969 INFO L137 encePairwiseOnDemand]: 190/196 looper letters, 29 selfloop transitions, 10 changer transitions 0/202 dead transitions. [2022-11-16 11:10:09,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 202 transitions, 730 flow [2022-11-16 11:10:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:10:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-16 11:10:09,972 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-11-16 11:10:09,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-16 11:10:09,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-16 11:10:09,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:10:09,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-16 11:10:09,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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-16 11:10:09,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:09,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:09,985 INFO L175 Difference]: Start difference. First operand has 177 places, 207 transitions, 698 flow. Second operand 3 states and 504 transitions. [2022-11-16 11:10:09,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 202 transitions, 730 flow [2022-11-16 11:10:09,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 202 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:10:09,994 INFO L231 Difference]: Finished difference. Result has 179 places, 197 transitions, 656 flow [2022-11-16 11:10:09,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=179, PETRI_TRANSITIONS=197} [2022-11-16 11:10:09,999 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -10 predicate places. [2022-11-16 11:10:09,999 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 197 transitions, 656 flow [2022-11-16 11:10:10,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 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-16 11:10:10,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:10:10,004 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-16 11:10:10,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:10:10,004 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-16 11:10:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1067927210, now seen corresponding path program 1 times [2022-11-16 11:10:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:10,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297491688] [2022-11-16 11:10:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:10,076 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-16 11:10:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297491688] [2022-11-16 11:10:10,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297491688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:10,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:10,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185198557] [2022-11-16 11:10:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:10,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:10,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:10,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:10,087 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 196 [2022-11-16 11:10:10,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 197 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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-16 11:10:10,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:10:10,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 196 [2022-11-16 11:10:10,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:10:11,229 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L710-2-->L710-3: Formula: (= |v_readerThread1of1ForFork0_#t~nondet9#1_3| |v_#race~y~0_1|) InVars {readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~y~0][122], [Black: 225#true, 233#(= ~r~0 0), 77#L710-3true, 41#L720-4true, 243#true, 210#true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, 241#(not (= ~w~0 0)), 165#L701-2true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 98#L703-4true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:11,229 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-16 11:10:11,230 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:10:11,230 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:10:11,230 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-16 11:10:11,568 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L702-1-->L702-2: Formula: (= |v_writerThread1of1ForFork2_#t~nondet7#1_3| |v_#race~x~0_7|) InVars {writerThread1of1ForFork2_#t~nondet7#1=|v_writerThread1of1ForFork2_#t~nondet7#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork2_#t~nondet7#1=|v_writerThread1of1ForFork2_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~x~0][139], [Black: 227#(= |#race~x~0| 0), 233#(= ~r~0 0), 70#L709-1true, 41#L720-4true, 243#true, 210#true, 53#L702-2true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, 241#(not (= ~w~0 0)), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 98#L703-4true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:11,568 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is not cut-off event [2022-11-16 11:10:11,569 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:11,569 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:11,570 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:12,558 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L710-2-->L710-3: Formula: (= |v_readerThread1of1ForFork0_#t~nondet9#1_3| |v_#race~y~0_1|) InVars {readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~y~0][122], [Black: 225#true, 233#(= ~r~0 0), 77#L710-3true, 243#true, 210#true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, 241#(not (= ~w~0 0)), 165#L701-2true, 96#L721-7true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:12,558 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-16 11:10:12,558 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:10:12,559 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:10:12,559 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:10:12,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L710-2-->L710-3: Formula: (= |v_readerThread1of1ForFork0_#t~nondet9#1_3| |v_#race~y~0_1|) InVars {readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~y~0][122], [Black: 225#true, 241#(not (= ~w~0 0)), 233#(= ~r~0 0), 77#L710-3true, 165#L701-2true, 243#true, 210#true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 82#L722-7true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:12,846 INFO L383 tUnfolder$Statistics]: this new event has 103 ancestors and is cut-off event [2022-11-16 11:10:12,846 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-16 11:10:12,846 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-16 11:10:12,846 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-16 11:10:12,984 INFO L130 PetriNetUnfolder]: 4843/17585 cut-off events. [2022-11-16 11:10:12,985 INFO L131 PetriNetUnfolder]: For 11491/11729 co-relation queries the response was YES. [2022-11-16 11:10:13,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36572 conditions, 17585 events. 4843/17585 cut-off events. For 11491/11729 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 222714 event pairs, 2577 based on Foata normal form. 11/14660 useless extension candidates. Maximal degree in co-relation 36562. Up to 6553 conditions per place. [2022-11-16 11:10:13,483 INFO L137 encePairwiseOnDemand]: 190/196 looper letters, 58 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2022-11-16 11:10:13,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 217 transitions, 881 flow [2022-11-16 11:10:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:10:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2022-11-16 11:10:13,487 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8282312925170068 [2022-11-16 11:10:13,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2022-11-16 11:10:13,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2022-11-16 11:10:13,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:10:13,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2022-11-16 11:10:13,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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-16 11:10:13,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:13,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:13,493 INFO L175 Difference]: Start difference. First operand has 179 places, 197 transitions, 656 flow. Second operand 3 states and 487 transitions. [2022-11-16 11:10:13,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 217 transitions, 881 flow [2022-11-16 11:10:13,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 217 transitions, 865 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:10:13,507 INFO L231 Difference]: Finished difference. Result has 182 places, 201 transitions, 684 flow [2022-11-16 11:10:13,508 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=182, PETRI_TRANSITIONS=201} [2022-11-16 11:10:13,509 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -7 predicate places. [2022-11-16 11:10:13,509 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 201 transitions, 684 flow [2022-11-16 11:10:13,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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-16 11:10:13,510 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:10:13,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] [2022-11-16 11:10:13,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:10:13,510 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-16 11:10:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2143213476, now seen corresponding path program 1 times [2022-11-16 11:10:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:13,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898921908] [2022-11-16 11:10:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:13,561 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-16 11:10:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:13,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898921908] [2022-11-16 11:10:13,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898921908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:13,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:13,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:13,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674047010] [2022-11-16 11:10:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:13,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:13,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:13,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:13,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:13,566 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 196 [2022-11-16 11:10:13,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 201 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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-16 11:10:13,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:10:13,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 196 [2022-11-16 11:10:13,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:10:15,755 INFO L130 PetriNetUnfolder]: 3596/14110 cut-off events. [2022-11-16 11:10:15,755 INFO L131 PetriNetUnfolder]: For 10419/11172 co-relation queries the response was YES. [2022-11-16 11:10:15,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31321 conditions, 14110 events. 3596/14110 cut-off events. For 10419/11172 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 175900 event pairs, 1777 based on Foata normal form. 17/12042 useless extension candidates. Maximal degree in co-relation 31309. Up to 5298 conditions per place. [2022-11-16 11:10:15,884 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 81 selfloop transitions, 10 changer transitions 0/226 dead transitions. [2022-11-16 11:10:15,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 226 transitions, 974 flow [2022-11-16 11:10:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:10:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-11-16 11:10:15,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.814625850340136 [2022-11-16 11:10:15,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2022-11-16 11:10:15,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2022-11-16 11:10:15,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:10:15,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2022-11-16 11:10:15,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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-16 11:10:15,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:15,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:15,893 INFO L175 Difference]: Start difference. First operand has 182 places, 201 transitions, 684 flow. Second operand 3 states and 479 transitions. [2022-11-16 11:10:15,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 226 transitions, 974 flow [2022-11-16 11:10:15,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 226 transitions, 964 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:10:15,918 INFO L231 Difference]: Finished difference. Result has 184 places, 209 transitions, 772 flow [2022-11-16 11:10:15,918 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=184, PETRI_TRANSITIONS=209} [2022-11-16 11:10:15,919 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -5 predicate places. [2022-11-16 11:10:15,919 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 209 transitions, 772 flow [2022-11-16 11:10:15,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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-16 11:10:15,920 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:10:15,920 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-16 11:10:15,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:10:15,921 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-16 11:10:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1797253137, now seen corresponding path program 1 times [2022-11-16 11:10:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:15,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671862497] [2022-11-16 11:10:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:15,974 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-16 11:10:15,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:15,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671862497] [2022-11-16 11:10:15,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671862497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:15,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:15,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797787076] [2022-11-16 11:10:15,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:15,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:15,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:15,978 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 196 [2022-11-16 11:10:15,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 209 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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-16 11:10:15,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:10:15,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 196 [2022-11-16 11:10:15,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:10:17,246 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L702-1-->L702-2: Formula: (= |v_writerThread1of1ForFork2_#t~nondet7#1_3| |v_#race~x~0_7|) InVars {writerThread1of1ForFork2_#t~nondet7#1=|v_writerThread1of1ForFork2_#t~nondet7#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork2_#t~nondet7#1=|v_writerThread1of1ForFork2_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~x~0][137], [251#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 227#(= |#race~x~0| 0), 233#(= ~r~0 0), 41#L720-4true, 70#L709-1true, 210#true, 53#L702-2true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, Black: 245#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), 257#(= |#race~y~0| 0), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 98#L703-4true, Black: 249#true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:17,247 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is not cut-off event [2022-11-16 11:10:17,247 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:17,247 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:17,247 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 11:10:17,370 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L710-2-->L710-3: Formula: (= |v_readerThread1of1ForFork0_#t~nondet9#1_3| |v_#race~y~0_1|) InVars {readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~y~0][144], [Black: 225#true, 233#(= ~r~0 0), 77#L710-3true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, 255#true, 165#L701-2true, Black: 245#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), 249#true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 98#L703-4true, Black: 251#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:17,371 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is not cut-off event [2022-11-16 11:10:17,371 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 11:10:17,371 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 11:10:17,371 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 11:10:18,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L710-2-->L710-3: Formula: (= |v_readerThread1of1ForFork0_#t~nondet9#1_3| |v_#race~y~0_1|) InVars {readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~y~0][144], [Black: 225#true, 233#(= ~r~0 0), 77#L710-3true, 210#true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 61#L712-1true, 255#true, 96#L721-7true, 165#L701-2true, Black: 245#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), 249#true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 251#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:18,743 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is not cut-off event [2022-11-16 11:10:18,743 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-11-16 11:10:18,743 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-11-16 11:10:18,743 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-11-16 11:10:19,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L710-2-->L710-3: Formula: (= |v_readerThread1of1ForFork0_#t~nondet9#1_3| |v_#race~y~0_1|) InVars {readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork0_#t~nondet9#1=|v_readerThread1of1ForFork0_#t~nondet9#1_3|} AuxVars[] AssignedVars[#race~y~0][144], [Black: 225#true, 233#(= ~r~0 0), 77#L710-3true, 210#true, readerThread1of1ForFork0InUse, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 255#true, 165#L701-2true, Black: 245#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), 249#true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 82#L722-7true, Black: 251#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-16 11:10:19,019 INFO L383 tUnfolder$Statistics]: this new event has 103 ancestors and is not cut-off event [2022-11-16 11:10:19,020 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is not cut-off event [2022-11-16 11:10:19,020 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is not cut-off event [2022-11-16 11:10:19,020 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is not cut-off event [2022-11-16 11:10:19,181 INFO L130 PetriNetUnfolder]: 4614/18623 cut-off events. [2022-11-16 11:10:19,181 INFO L131 PetriNetUnfolder]: For 16516/17085 co-relation queries the response was YES. [2022-11-16 11:10:19,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41592 conditions, 18623 events. 4614/18623 cut-off events. For 16516/17085 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 244446 event pairs, 1420 based on Foata normal form. 39/16181 useless extension candidates. Maximal degree in co-relation 41579. Up to 4180 conditions per place. [2022-11-16 11:10:19,357 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 69 selfloop transitions, 7 changer transitions 0/241 dead transitions. [2022-11-16 11:10:19,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 241 transitions, 1089 flow [2022-11-16 11:10:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:10:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2022-11-16 11:10:19,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8469387755102041 [2022-11-16 11:10:19,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2022-11-16 11:10:19,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2022-11-16 11:10:19,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:10:19,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2022-11-16 11:10:19,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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-16 11:10:19,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:19,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-16 11:10:19,365 INFO L175 Difference]: Start difference. First operand has 184 places, 209 transitions, 772 flow. Second operand 3 states and 498 transitions. [2022-11-16 11:10:19,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 241 transitions, 1089 flow [2022-11-16 11:10:19,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 241 transitions, 1057 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-16 11:10:19,442 INFO L231 Difference]: Finished difference. Result has 186 places, 215 transitions, 802 flow [2022-11-16 11:10:19,442 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=186, PETRI_TRANSITIONS=215} [2022-11-16 11:10:19,443 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2022-11-16 11:10:19,443 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 215 transitions, 802 flow [2022-11-16 11:10:19,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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-16 11:10:19,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:10:19,444 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-16 11:10:19,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:10:19,445 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-16 11:10:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1358730945, now seen corresponding path program 1 times [2022-11-16 11:10:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:19,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394244741] [2022-11-16 11:10:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:10:19,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:10:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:10:19,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:10:19,513 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:10:19,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writerErr4ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2022-11-16 11:10:19,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2022-11-16 11:10:19,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2022-11-16 11:10:19,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2022-11-16 11:10:19,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2022-11-16 11:10:19,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2022-11-16 11:10:19,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2022-11-16 11:10:19,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2022-11-16 11:10:19,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2022-11-16 11:10:19,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2022-11-16 11:10:19,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2022-11-16 11:10:19,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2022-11-16 11:10:19,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2022-11-16 11:10:19,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2022-11-16 11:10:19,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 50 remaining) [2022-11-16 11:10:19,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 50 remaining) [2022-11-16 11:10:19,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 50 remaining) [2022-11-16 11:10:19,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 50 remaining) [2022-11-16 11:10:19,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2022-11-16 11:10:19,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2022-11-16 11:10:19,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2022-11-16 11:10:19,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2022-11-16 11:10:19,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2022-11-16 11:10:19,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2022-11-16 11:10:19,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2022-11-16 11:10:19,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2022-11-16 11:10:19,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2022-11-16 11:10:19,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2022-11-16 11:10:19,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2022-11-16 11:10:19,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2022-11-16 11:10:19,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2022-11-16 11:10:19,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2022-11-16 11:10:19,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2022-11-16 11:10:19,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2022-11-16 11:10:19,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2022-11-16 11:10:19,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2022-11-16 11:10:19,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2022-11-16 11:10:19,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2022-11-16 11:10:19,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2022-11-16 11:10:19,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2022-11-16 11:10:19,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2022-11-16 11:10:19,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2022-11-16 11:10:19,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2022-11-16 11:10:19,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2022-11-16 11:10:19,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2022-11-16 11:10:19,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2022-11-16 11:10:19,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2022-11-16 11:10:19,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2022-11-16 11:10:19,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2022-11-16 11:10:19,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2022-11-16 11:10:19,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:10:19,532 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:19,541 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:10:19,542 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:10:19,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:10:19 BasicIcfg [2022-11-16 11:10:19,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:10:19,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:10:19,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:10:19,634 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:10:19,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:09:40" (3/4) ... [2022-11-16 11:10:19,638 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:10:19,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:10:19,639 INFO L158 Benchmark]: Toolchain (without parser) took 40706.44ms. Allocated memory was 111.1MB in the beginning and 12.0GB in the end (delta: 11.9GB). Free memory was 66.8MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-16 11:10:19,640 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 111.1MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:10:19,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.56ms. Allocated memory is still 111.1MB. Free memory was 66.6MB in the beginning and 77.3MB in the end (delta: -10.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-11-16 11:10:19,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.41ms. Allocated memory is still 111.1MB. Free memory was 77.3MB in the beginning and 74.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:10:19,648 INFO L158 Benchmark]: Boogie Preprocessor took 37.99ms. Allocated memory is still 111.1MB. Free memory was 74.7MB in the beginning and 72.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:10:19,649 INFO L158 Benchmark]: RCFGBuilder took 1080.06ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 72.7MB in the beginning and 122.2MB in the end (delta: -49.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2022-11-16 11:10:19,649 INFO L158 Benchmark]: TraceAbstraction took 38640.92ms. Allocated memory was 146.8MB in the beginning and 12.0GB in the end (delta: 11.8GB). Free memory was 120.9MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-16 11:10:19,649 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 12.0GB. Free memory is still 10.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:10:19,652 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.42ms. Allocated memory is still 111.1MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.56ms. Allocated memory is still 111.1MB. Free memory was 66.6MB in the beginning and 77.3MB in the end (delta: -10.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.41ms. Allocated memory is still 111.1MB. Free memory was 77.3MB in the beginning and 74.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.99ms. Allocated memory is still 111.1MB. Free memory was 74.7MB in the beginning and 72.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1080.06ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 72.7MB in the beginning and 122.2MB in the end (delta: -49.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 38640.92ms. Allocated memory was 146.8MB in the beginning and 12.0GB in the end (delta: 11.8GB). Free memory was 120.9MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 12.0GB. Free memory is still 10.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 703]: 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] [L716] 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] [L717] 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] [L718] 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] [L701] 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 [L701] RET 1 __VERIFIER_atomic_take_write_lock() [L702] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L703] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=0, w=0, w = 0=50, x=3, y=0] [L707] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=3, y=0] [L708] 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 [L708] RET 2 __VERIFIER_atomic_take_read_lock() [L703] 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 [703] - 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: 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: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: 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: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races 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: 720]: 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: 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: 719]: 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: 702]: 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, 250 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: 38.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 452 IncrementalHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 112 mSDtfsCounter, 452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=802occurred in iteration=9, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 513 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-16 11:10:19,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_976f5f5e-1dff-4f62-ac01-fe7837c8eec4/bin/uautomizer-tPACEb0tL8/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