./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:51:01,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:01,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:01,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:01,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:01,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:01,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:01,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:01,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:01,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:01,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:01,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:01,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:01,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:01,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:01,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:01,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:01,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:01,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:01,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:01,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:01,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:01,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:01,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:01,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:01,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:01,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:01,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:01,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:01,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:01,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:01,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:01,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:01,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:01,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:01,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:01,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:01,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:01,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:01,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:01,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:01,093 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:51:01,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:01,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:01,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:01,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:01,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:01,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:01,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:01,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:01,133 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:01,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:01,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:51:01,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:01,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:51:01,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:01,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:51:01,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:01,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:51:01,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:51:01,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:51:01,137 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:01,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:51:01,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:01,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:01,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:01,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:01,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:01,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:01,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:51:01,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:01,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:01,141 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:51:01,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:51:01,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:51:01,142 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_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2022-11-02 20:51:01,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:01,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:01,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:01,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:01,525 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:01,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-02 20:51:01,589 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/data/a16c19d90/41ce147c67854543b8e04022a77a35cb/FLAGbf38fe701 [2022-11-02 20:51:02,182 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:02,183 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-02 20:51:02,197 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/data/a16c19d90/41ce147c67854543b8e04022a77a35cb/FLAGbf38fe701 [2022-11-02 20:51:02,469 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/data/a16c19d90/41ce147c67854543b8e04022a77a35cb [2022-11-02 20:51:02,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:02,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:02,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:02,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:02,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:02,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:02" (1/1) ... [2022-11-02 20:51:02,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c886f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:02, skipping insertion in model container [2022-11-02 20:51:02,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:02" (1/1) ... [2022-11-02 20:51:02,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:02,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:02,803 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-02 20:51:02,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-02 20:51:02,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:02,955 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:02,985 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-02 20:51:03,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-02 20:51:03,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:03,063 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:03,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03 WrapperNode [2022-11-02 20:51:03,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:03,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:03,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:03,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:03,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,138 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-11-02 20:51:03,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:03,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:03,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:03,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:03,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:03,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:03,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:03,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:03,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (1/1) ... [2022-11-02 20:51:03,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:03,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:03,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:03,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:51:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:51:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:51:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-02 20:51:03,279 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-02 20:51:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:51:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:51:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:51:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-02 20:51:03,281 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-02 20:51:03,283 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:51:03,409 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:03,411 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:03,631 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:03,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:03,681 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:51:03,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:03 BoogieIcfgContainer [2022-11-02 20:51:03,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:03,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:03,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:03,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:03,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:02" (1/3) ... [2022-11-02 20:51:03,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d58022a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:03, skipping insertion in model container [2022-11-02 20:51:03,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:03" (2/3) ... [2022-11-02 20:51:03,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d58022a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:03, skipping insertion in model container [2022-11-02 20:51:03,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:03" (3/3) ... [2022-11-02 20:51:03,705 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-11-02 20:51:03,715 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:51:03,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:03,727 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:51:03,728 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:51:03,830 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:51:03,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 260 flow [2022-11-02 20:51:03,961 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-02 20:51:03,961 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:51:03,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 110 events. 2/110 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-02 20:51:03,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 260 flow [2022-11-02 20:51:03,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 96 transitions, 213 flow [2022-11-02 20:51:03,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:03,989 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;@19d705ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:03,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 20:51:04,007 INFO L130 PetriNetUnfolder]: 1/58 cut-off events. [2022-11-02 20:51:04,007 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:51:04,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:04,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:04,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2006515335, now seen corresponding path program 1 times [2022-11-02 20:51:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:04,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097894199] [2022-11-02 20:51:04,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:04,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:04,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097894199] [2022-11-02 20:51:04,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097894199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:04,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:04,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241641179] [2022-11-02 20:51:04,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:04,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:04,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:04,557 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-02 20:51:04,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:04,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:04,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-02 20:51:04,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:06,443 INFO L130 PetriNetUnfolder]: 3525/7769 cut-off events. [2022-11-02 20:51:06,443 INFO L131 PetriNetUnfolder]: For 1654/1654 co-relation queries the response was YES. [2022-11-02 20:51:06,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 7769 events. 3525/7769 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 71764 event pairs, 961 based on Foata normal form. 422/7837 useless extension candidates. Maximal degree in co-relation 13398. Up to 1729 conditions per place. [2022-11-02 20:51:06,528 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 116 selfloop transitions, 32 changer transitions 0/214 dead transitions. [2022-11-02 20:51:06,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 214 transitions, 823 flow [2022-11-02 20:51:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:51:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:51:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1160 transitions. [2022-11-02 20:51:06,588 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-11-02 20:51:06,589 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1160 transitions. [2022-11-02 20:51:06,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1160 transitions. [2022-11-02 20:51:06,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:06,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1160 transitions. [2022-11-02 20:51:06,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.66666666666667) internal successors, (1160), 12 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:06,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:06,624 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:06,627 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 213 flow. Second operand 12 states and 1160 transitions. [2022-11-02 20:51:06,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 214 transitions, 823 flow [2022-11-02 20:51:06,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 214 transitions, 764 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-02 20:51:06,675 INFO L231 Difference]: Finished difference. Result has 119 places, 129 transitions, 416 flow [2022-11-02 20:51:06,677 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=119, PETRI_TRANSITIONS=129} [2022-11-02 20:51:06,685 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 12 predicate places. [2022-11-02 20:51:06,685 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 416 flow [2022-11-02 20:51:06,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:06,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:06,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:06,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:06,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1738116757, now seen corresponding path program 1 times [2022-11-02 20:51:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:06,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454665248] [2022-11-02 20:51:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:06,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:06,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454665248] [2022-11-02 20:51:06,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454665248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:06,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:06,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125736664] [2022-11-02 20:51:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:06,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:06,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:06,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:06,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:06,975 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 114 [2022-11-02 20:51:06,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:06,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:06,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 114 [2022-11-02 20:51:06,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:07,435 INFO L130 PetriNetUnfolder]: 398/2267 cut-off events. [2022-11-02 20:51:07,436 INFO L131 PetriNetUnfolder]: For 379/391 co-relation queries the response was YES. [2022-11-02 20:51:07,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 2267 events. 398/2267 cut-off events. For 379/391 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 22123 event pairs, 93 based on Foata normal form. 51/2197 useless extension candidates. Maximal degree in co-relation 3549. Up to 251 conditions per place. [2022-11-02 20:51:07,459 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 15 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2022-11-02 20:51:07,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 134 transitions, 470 flow [2022-11-02 20:51:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-11-02 20:51:07,463 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2022-11-02 20:51:07,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-11-02 20:51:07,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-11-02 20:51:07,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:07,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-11-02 20:51:07,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:07,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:07,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:07,467 INFO L175 Difference]: Start difference. First operand has 119 places, 129 transitions, 416 flow. Second operand 3 states and 314 transitions. [2022-11-02 20:51:07,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 134 transitions, 470 flow [2022-11-02 20:51:07,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:51:07,483 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 432 flow [2022-11-02 20:51:07,484 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2022-11-02 20:51:07,484 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2022-11-02 20:51:07,485 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 432 flow [2022-11-02 20:51:07,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:07,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:07,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:07,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:07,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash 195211785, now seen corresponding path program 2 times [2022-11-02 20:51:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:07,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745870246] [2022-11-02 20:51:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:07,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745870246] [2022-11-02 20:51:07,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745870246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:07,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:07,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083914664] [2022-11-02 20:51:07,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:07,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:07,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:07,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:07,710 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-11-02 20:51:07,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:07,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:07,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-11-02 20:51:07,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:08,593 INFO L130 PetriNetUnfolder]: 1590/4818 cut-off events. [2022-11-02 20:51:08,594 INFO L131 PetriNetUnfolder]: For 2362/2464 co-relation queries the response was YES. [2022-11-02 20:51:08,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10147 conditions, 4818 events. 1590/4818 cut-off events. For 2362/2464 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 48954 event pairs, 145 based on Foata normal form. 50/4728 useless extension candidates. Maximal degree in co-relation 8937. Up to 767 conditions per place. [2022-11-02 20:51:08,643 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 45 selfloop transitions, 19 changer transitions 4/175 dead transitions. [2022-11-02 20:51:08,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 175 transitions, 737 flow [2022-11-02 20:51:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:51:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-11-02 20:51:08,646 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9087719298245615 [2022-11-02 20:51:08,646 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2022-11-02 20:51:08,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2022-11-02 20:51:08,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:08,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2022-11-02 20:51:08,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:08,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:08,650 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:08,650 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 432 flow. Second operand 5 states and 518 transitions. [2022-11-02 20:51:08,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 175 transitions, 737 flow [2022-11-02 20:51:08,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 175 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:08,678 INFO L231 Difference]: Finished difference. Result has 124 places, 143 transitions, 510 flow [2022-11-02 20:51:08,679 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=124, PETRI_TRANSITIONS=143} [2022-11-02 20:51:08,681 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 17 predicate places. [2022-11-02 20:51:08,681 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 143 transitions, 510 flow [2022-11-02 20:51:08,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:08,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:08,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:08,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:08,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:08,683 INFO L85 PathProgramCache]: Analyzing trace with hash 579299824, now seen corresponding path program 1 times [2022-11-02 20:51:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:08,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404201142] [2022-11-02 20:51:08,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:08,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:08,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:08,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404201142] [2022-11-02 20:51:08,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404201142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:08,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:08,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485061857] [2022-11-02 20:51:08,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:08,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:08,855 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-02 20:51:08,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 143 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:08,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:08,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-02 20:51:08,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:12,809 INFO L130 PetriNetUnfolder]: 8131/17870 cut-off events. [2022-11-02 20:51:12,810 INFO L131 PetriNetUnfolder]: For 15561/15640 co-relation queries the response was YES. [2022-11-02 20:51:12,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44383 conditions, 17870 events. 8131/17870 cut-off events. For 15561/15640 co-relation queries the response was YES. Maximal size of possible extension queue 1622. Compared 195642 event pairs, 1270 based on Foata normal form. 20/17361 useless extension candidates. Maximal degree in co-relation 43808. Up to 3340 conditions per place. [2022-11-02 20:51:13,017 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 207 selfloop transitions, 134 changer transitions 25/442 dead transitions. [2022-11-02 20:51:13,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 442 transitions, 2686 flow [2022-11-02 20:51:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:51:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:51:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1151 transitions. [2022-11-02 20:51:13,024 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.841374269005848 [2022-11-02 20:51:13,024 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1151 transitions. [2022-11-02 20:51:13,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1151 transitions. [2022-11-02 20:51:13,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:13,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1151 transitions. [2022-11-02 20:51:13,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.91666666666667) internal successors, (1151), 12 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:13,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:13,037 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:13,038 INFO L175 Difference]: Start difference. First operand has 124 places, 143 transitions, 510 flow. Second operand 12 states and 1151 transitions. [2022-11-02 20:51:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 442 transitions, 2686 flow [2022-11-02 20:51:13,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 442 transitions, 2680 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-02 20:51:13,270 INFO L231 Difference]: Finished difference. Result has 143 places, 298 transitions, 1900 flow [2022-11-02 20:51:13,270 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1900, PETRI_PLACES=143, PETRI_TRANSITIONS=298} [2022-11-02 20:51:13,271 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 36 predicate places. [2022-11-02 20:51:13,271 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 298 transitions, 1900 flow [2022-11-02 20:51:13,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:13,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:13,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:13,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:13,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:13,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:13,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1097766141, now seen corresponding path program 1 times [2022-11-02 20:51:13,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:13,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922209116] [2022-11-02 20:51:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:13,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:13,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922209116] [2022-11-02 20:51:13,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922209116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:13,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:13,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:13,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782194099] [2022-11-02 20:51:13,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:13,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:13,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:13,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:13,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:13,373 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-02 20:51:13,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 298 transitions, 1900 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:13,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:13,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-02 20:51:13,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:17,386 INFO L130 PetriNetUnfolder]: 9006/19880 cut-off events. [2022-11-02 20:51:17,387 INFO L131 PetriNetUnfolder]: For 29259/29357 co-relation queries the response was YES. [2022-11-02 20:51:17,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59351 conditions, 19880 events. 9006/19880 cut-off events. For 29259/29357 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 221624 event pairs, 1488 based on Foata normal form. 223/19912 useless extension candidates. Maximal degree in co-relation 58727. Up to 4759 conditions per place. [2022-11-02 20:51:17,596 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 237 selfloop transitions, 206 changer transitions 5/524 dead transitions. [2022-11-02 20:51:17,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 524 transitions, 4189 flow [2022-11-02 20:51:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:51:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1235 transitions. [2022-11-02 20:51:17,600 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-11-02 20:51:17,600 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1235 transitions. [2022-11-02 20:51:17,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1235 transitions. [2022-11-02 20:51:17,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:17,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1235 transitions. [2022-11-02 20:51:17,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.0) internal successors, (1235), 13 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,608 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:17,608 INFO L175 Difference]: Start difference. First operand has 143 places, 298 transitions, 1900 flow. Second operand 13 states and 1235 transitions. [2022-11-02 20:51:17,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 524 transitions, 4189 flow [2022-11-02 20:51:18,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 524 transitions, 4189 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:51:18,632 INFO L231 Difference]: Finished difference. Result has 163 places, 386 transitions, 3338 flow [2022-11-02 20:51:18,633 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3338, PETRI_PLACES=163, PETRI_TRANSITIONS=386} [2022-11-02 20:51:18,634 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 56 predicate places. [2022-11-02 20:51:18,634 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 386 transitions, 3338 flow [2022-11-02 20:51:18,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:18,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:18,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:18,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:51:18,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:18,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:18,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1042275993, now seen corresponding path program 1 times [2022-11-02 20:51:18,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:18,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642502891] [2022-11-02 20:51:18,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:18,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:18,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642502891] [2022-11-02 20:51:18,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642502891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:18,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:18,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485534623] [2022-11-02 20:51:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:18,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:18,737 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-02 20:51:18,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 386 transitions, 3338 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:18,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:18,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-02 20:51:18,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:23,373 INFO L130 PetriNetUnfolder]: 9876/21673 cut-off events. [2022-11-02 20:51:23,374 INFO L131 PetriNetUnfolder]: For 52197/52248 co-relation queries the response was YES. [2022-11-02 20:51:23,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71027 conditions, 21673 events. 9876/21673 cut-off events. For 52197/52248 co-relation queries the response was YES. Maximal size of possible extension queue 1940. Compared 241907 event pairs, 1828 based on Foata normal form. 239/21705 useless extension candidates. Maximal degree in co-relation 67915. Up to 5676 conditions per place. [2022-11-02 20:51:23,625 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 295 selfloop transitions, 249 changer transitions 8/643 dead transitions. [2022-11-02 20:51:23,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 643 transitions, 6329 flow [2022-11-02 20:51:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:51:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1239 transitions. [2022-11-02 20:51:23,629 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8360323886639676 [2022-11-02 20:51:23,629 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1239 transitions. [2022-11-02 20:51:23,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1239 transitions. [2022-11-02 20:51:23,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:23,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1239 transitions. [2022-11-02 20:51:23,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.3076923076923) internal successors, (1239), 13 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,637 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,637 INFO L175 Difference]: Start difference. First operand has 163 places, 386 transitions, 3338 flow. Second operand 13 states and 1239 transitions. [2022-11-02 20:51:23,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 643 transitions, 6329 flow [2022-11-02 20:51:25,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 643 transitions, 6261 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:25,103 INFO L231 Difference]: Finished difference. Result has 182 places, 484 transitions, 5114 flow [2022-11-02 20:51:25,104 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5114, PETRI_PLACES=182, PETRI_TRANSITIONS=484} [2022-11-02 20:51:25,104 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 75 predicate places. [2022-11-02 20:51:25,105 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 484 transitions, 5114 flow [2022-11-02 20:51:25,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:25,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:25,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:25,106 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1127280812, now seen corresponding path program 1 times [2022-11-02 20:51:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:25,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835075968] [2022-11-02 20:51:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:25,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:25,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835075968] [2022-11-02 20:51:25,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835075968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:25,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:25,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:25,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510893579] [2022-11-02 20:51:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:25,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:51:25,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:25,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:51:25,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:25,299 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 114 [2022-11-02 20:51:25,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 484 transitions, 5114 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:25,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 114 [2022-11-02 20:51:25,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:25,977 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([261] L738-2-->L741: Formula: (= (+ |v_readerThread1of1ForFork3_~l~0#1_7| 1) v_~r~0_3) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1][244], [Black: 171#true, Black: 241#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 182#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 244#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 254#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 234#true, Black: 186#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 252#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0)), Black: 173#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 246#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 188#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 237#(= ~y~0 ~x~0), Black: 178#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 239#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 118#L741true, Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#true, Black: 220#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|)), Black: 205#(= ~y~0 ~x~0), Black: 216#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 59#L754-2true, Black: 222#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 209#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 202#true, Black: 212#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 74#L717true, 268#(= ~r~0 0), 169#(and (not (= ~w~0 0)) (= ~r~0 0)), 207#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), readerThread1of1ForFork3InUse, 176#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)]) [2022-11-02 20:51:25,977 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:51:25,977 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:51:25,978 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:51:25,978 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:51:26,009 INFO L130 PetriNetUnfolder]: 947/3465 cut-off events. [2022-11-02 20:51:26,009 INFO L131 PetriNetUnfolder]: For 8687/8759 co-relation queries the response was YES. [2022-11-02 20:51:26,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10659 conditions, 3465 events. 947/3465 cut-off events. For 8687/8759 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 34494 event pairs, 124 based on Foata normal form. 114/3539 useless extension candidates. Maximal degree in co-relation 10387. Up to 547 conditions per place. [2022-11-02 20:51:26,038 INFO L137 encePairwiseOnDemand]: 107/114 looper letters, 40 selfloop transitions, 11 changer transitions 44/281 dead transitions. [2022-11-02 20:51:26,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 281 transitions, 2262 flow [2022-11-02 20:51:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:51:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2022-11-02 20:51:26,040 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2022-11-02 20:51:26,040 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2022-11-02 20:51:26,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2022-11-02 20:51:26,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:26,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2022-11-02 20:51:26,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,045 INFO L175 Difference]: Start difference. First operand has 182 places, 484 transitions, 5114 flow. Second operand 5 states and 522 transitions. [2022-11-02 20:51:26,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 281 transitions, 2262 flow [2022-11-02 20:51:26,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 281 transitions, 2219 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:26,142 INFO L231 Difference]: Finished difference. Result has 185 places, 226 transitions, 1692 flow [2022-11-02 20:51:26,143 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1692, PETRI_PLACES=185, PETRI_TRANSITIONS=226} [2022-11-02 20:51:26,144 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 78 predicate places. [2022-11-02 20:51:26,144 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 226 transitions, 1692 flow [2022-11-02 20:51:26,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:26,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:26,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:26,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1072455534, now seen corresponding path program 1 times [2022-11-02 20:51:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:26,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085285664] [2022-11-02 20:51:26,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:26,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:26,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085285664] [2022-11-02 20:51:26,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085285664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:26,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:26,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144369385] [2022-11-02 20:51:26,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:26,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:26,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:26,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:26,346 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-11-02 20:51:26,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 226 transitions, 1692 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:26,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:26,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-11-02 20:51:26,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:27,078 INFO L130 PetriNetUnfolder]: 879/3214 cut-off events. [2022-11-02 20:51:27,078 INFO L131 PetriNetUnfolder]: For 8924/8988 co-relation queries the response was YES. [2022-11-02 20:51:27,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10814 conditions, 3214 events. 879/3214 cut-off events. For 8924/8988 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 32032 event pairs, 138 based on Foata normal form. 12/3192 useless extension candidates. Maximal degree in co-relation 10370. Up to 328 conditions per place. [2022-11-02 20:51:27,108 INFO L137 encePairwiseOnDemand]: 106/114 looper letters, 55 selfloop transitions, 17 changer transitions 37/283 dead transitions. [2022-11-02 20:51:27,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 283 transitions, 2246 flow [2022-11-02 20:51:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:51:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 20:51:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 803 transitions. [2022-11-02 20:51:27,112 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8804824561403509 [2022-11-02 20:51:27,112 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 803 transitions. [2022-11-02 20:51:27,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 803 transitions. [2022-11-02 20:51:27,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:27,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 803 transitions. [2022-11-02 20:51:27,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.375) internal successors, (803), 8 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,119 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,119 INFO L175 Difference]: Start difference. First operand has 185 places, 226 transitions, 1692 flow. Second operand 8 states and 803 transitions. [2022-11-02 20:51:27,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 283 transitions, 2246 flow [2022-11-02 20:51:27,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 283 transitions, 2191 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-02 20:51:27,224 INFO L231 Difference]: Finished difference. Result has 189 places, 226 transitions, 1707 flow [2022-11-02 20:51:27,224 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1707, PETRI_PLACES=189, PETRI_TRANSITIONS=226} [2022-11-02 20:51:27,225 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 82 predicate places. [2022-11-02 20:51:27,225 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 226 transitions, 1707 flow [2022-11-02 20:51:27,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:27,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:27,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:51:27,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1384974012, now seen corresponding path program 2 times [2022-11-02 20:51:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:27,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318514169] [2022-11-02 20:51:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:27,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318514169] [2022-11-02 20:51:27,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318514169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:27,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:27,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287115057] [2022-11-02 20:51:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:27,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:27,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:27,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:27,397 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-11-02 20:51:27,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 226 transitions, 1707 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:27,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-11-02 20:51:27,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:27,978 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([246] L738-2-->L741: Formula: (= v_~r~0_3 (+ |v_readerThread1of1ForFork0_~l~0#1_7| 1)) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][223], [Black: 241#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 171#true, Black: 244#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 182#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 254#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), 288#(= ~r~0 0), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 186#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 234#true, Black: 252#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0)), Black: 173#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 246#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 188#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 237#(= ~y~0 ~x~0), Black: 178#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 274#(= ~r~0 0), 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 239#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 275#(<= 1 ~r~0), Black: 128#true, Black: 220#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|)), Black: 205#(= ~y~0 ~x~0), Black: 216#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 222#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 209#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 202#true, Black: 212#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 43#L744true, 74#L717true, 35#L741true, 76#L753-2true, readerThread1of1ForFork3InUse, 207#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 176#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)]) [2022-11-02 20:51:27,978 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:51:27,979 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:51:27,979 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:51:27,979 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:51:28,101 INFO L130 PetriNetUnfolder]: 672/2660 cut-off events. [2022-11-02 20:51:28,101 INFO L131 PetriNetUnfolder]: For 7007/7077 co-relation queries the response was YES. [2022-11-02 20:51:28,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8709 conditions, 2660 events. 672/2660 cut-off events. For 7007/7077 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 25853 event pairs, 128 based on Foata normal form. 63/2683 useless extension candidates. Maximal degree in co-relation 8405. Up to 406 conditions per place. [2022-11-02 20:51:28,117 INFO L137 encePairwiseOnDemand]: 106/114 looper letters, 51 selfloop transitions, 14 changer transitions 23/244 dead transitions. [2022-11-02 20:51:28,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 244 transitions, 1889 flow [2022-11-02 20:51:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:51:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:51:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions. [2022-11-02 20:51:28,121 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8759398496240601 [2022-11-02 20:51:28,121 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 699 transitions. [2022-11-02 20:51:28,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions. [2022-11-02 20:51:28,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:28,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions. [2022-11-02 20:51:28,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,130 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,130 INFO L175 Difference]: Start difference. First operand has 189 places, 226 transitions, 1707 flow. Second operand 7 states and 699 transitions. [2022-11-02 20:51:28,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 244 transitions, 1889 flow [2022-11-02 20:51:28,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 244 transitions, 1830 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-02 20:51:28,193 INFO L231 Difference]: Finished difference. Result has 192 places, 203 transitions, 1418 flow [2022-11-02 20:51:28,193 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1418, PETRI_PLACES=192, PETRI_TRANSITIONS=203} [2022-11-02 20:51:28,194 INFO L287 CegarLoopForPetriNet]: 107 programPoint places, 85 predicate places. [2022-11-02 20:51:28,195 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 203 transitions, 1418 flow [2022-11-02 20:51:28,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:28,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:28,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:51:28,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:51:28,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2051257558, now seen corresponding path program 3 times [2022-11-02 20:51:28,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:28,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668176193] [2022-11-02 20:51:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:28,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:28,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:28,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:28,288 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:51:28,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-02 20:51:28,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 20:51:28,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-02 20:51:28,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-02 20:51:28,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-02 20:51:28,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-02 20:51:28,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 20:51:28,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:51:28,297 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-11-02 20:51:28,303 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:51:28,304 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:51:28,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:51:28 BasicIcfg [2022-11-02 20:51:28,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:51:28,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:51:28,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:51:28,397 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:51:28,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:03" (3/4) ... [2022-11-02 20:51:28,399 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:51:28,501 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:51:28,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:51:28,502 INFO L158 Benchmark]: Toolchain (without parser) took 26025.40ms. Allocated memory was 136.3MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 103.0MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 645.7MB. Max. memory is 16.1GB. [2022-11-02 20:51:28,503 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 98.6MB. Free memory was 54.9MB in the beginning and 54.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:51:28,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.56ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 100.4MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:51:28,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.44ms. Allocated memory is still 136.3MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:28,504 INFO L158 Benchmark]: Boogie Preprocessor took 36.95ms. Allocated memory is still 136.3MB. Free memory was 98.3MB in the beginning and 96.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:28,504 INFO L158 Benchmark]: RCFGBuilder took 491.57ms. Allocated memory is still 136.3MB. Free memory was 96.7MB in the beginning and 80.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:51:28,505 INFO L158 Benchmark]: TraceAbstraction took 24709.52ms. Allocated memory was 136.3MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 80.0MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 614.9MB. Max. memory is 16.1GB. [2022-11-02 20:51:28,505 INFO L158 Benchmark]: Witness Printer took 105.21ms. Allocated memory is still 8.1GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:51:28,507 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.31ms. Allocated memory is still 98.6MB. Free memory was 54.9MB in the beginning and 54.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.56ms. Allocated memory is still 136.3MB. Free memory was 103.0MB in the beginning and 100.4MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.44ms. Allocated memory is still 136.3MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.95ms. Allocated memory is still 136.3MB. Free memory was 98.3MB in the beginning and 96.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.57ms. Allocated memory is still 136.3MB. Free memory was 96.7MB in the beginning and 80.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24709.52ms. Allocated memory was 136.3MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 80.0MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 614.9MB. Max. memory is 16.1GB. * Witness Printer took 105.21ms. Allocated memory is still 8.1GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L748] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-2, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L724] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=-1, r=1, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=0, r=1, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L724] 4 int l; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] 4 reach_error() VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: 749]: 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: 752]: 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: 750]: 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: 751]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 7 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: 24.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 600 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 600 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 767 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1491 IncrementalHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 169 mSDtfsCounter, 1491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5114occurred in iteration=6, InterpolantAutomatonStates: 78, 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.4s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 856 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-02 20:51:28,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16926a08-18fe-455c-b26a-c30a96728b1e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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