./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.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_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/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_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/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_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/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 f5d83fc7ee9b26859e9993ee2fcff801f4a9d92dea17a48a6a39594bb6b759ca --- 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 19:53:47,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:53:47,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:53:47,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:53:47,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:53:47,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:53:47,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:53:47,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:53:47,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:53:47,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:53:47,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:53:47,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:53:47,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:53:47,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:53:47,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:53:47,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:53:47,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:53:47,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:53:47,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:53:47,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:53:47,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:53:47,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:53:47,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:53:47,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:53:47,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:53:47,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:53:47,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:53:47,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:53:47,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:53:47,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:53:47,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:53:47,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:53:47,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:53:47,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:53:47,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:53:47,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:53:47,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:53:47,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:53:47,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:53:47,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:53:47,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:53:47,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 19:53:47,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:53:47,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:53:47,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:53:47,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:53:47,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:53:47,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:53:47,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:53:47,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:53:47,869 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:53:47,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:53:47,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:53:47,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:53:47,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:53:47,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:53:47,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 19:53:47,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:53:47,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 19:53:47,873 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:53:47,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 19:53:47,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:53:47,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 19:53:47,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:53:47,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:53:47,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:53:47,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:53:47,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:53:47,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:53:47,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 19:53:47,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:53:47,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:53:47,877 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 19:53:47,877 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 19:53:47,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 19:53:47,878 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_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/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_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/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 -> f5d83fc7ee9b26859e9993ee2fcff801f4a9d92dea17a48a6a39594bb6b759ca [2022-11-02 19:53:48,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:53:48,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:53:48,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:53:48,289 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:53:48,290 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:53:48,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i [2022-11-02 19:53:48,384 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/data/adedf2a3b/b6156821acfa4140960f9423f94a20fc/FLAG132e34552 [2022-11-02 19:53:49,087 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:53:49,087 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i [2022-11-02 19:53:49,104 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/data/adedf2a3b/b6156821acfa4140960f9423f94a20fc/FLAG132e34552 [2022-11-02 19:53:49,370 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/data/adedf2a3b/b6156821acfa4140960f9423f94a20fc [2022-11-02 19:53:49,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:53:49,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:53:49,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:53:49,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:53:49,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:53:49,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:53:49" (1/1) ... [2022-11-02 19:53:49,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617dfdb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:49, skipping insertion in model container [2022-11-02 19:53:49,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:53:49" (1/1) ... [2022-11-02 19:53:49,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:53:49,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:53:49,696 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_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i[958,971] [2022-11-02 19:53:49,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:53:49,924 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:53:49,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_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i[958,971] [2022-11-02 19:53:49,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:53:50,021 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:53:50,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50 WrapperNode [2022-11-02 19:53:50,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:53:50,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:53:50,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:53:50,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:53:50,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,088 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 195 [2022-11-02 19:53:50,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:53:50,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:53:50,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:53:50,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:53:50,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,125 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:53:50,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:53:50,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:53:50,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:53:50,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (1/1) ... [2022-11-02 19:53:50,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:53:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:53:50,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:53:50,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:53:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 19:53:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 19:53:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:53:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 19:53:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 19:53:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 19:53:50,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 19:53:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 19:53:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 19:53:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 19:53:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 19:53:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-02 19:53:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-02 19:53:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:53:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 19:53:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:53:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:53:50,282 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 19:53:50,584 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:53:50,586 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:53:51,370 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:53:51,972 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:53:51,973 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 19:53:51,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:51 BoogieIcfgContainer [2022-11-02 19:53:51,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:53:51,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:53:51,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:53:51,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:53:51,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:53:49" (1/3) ... [2022-11-02 19:53:51,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96c6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:53:51, skipping insertion in model container [2022-11-02 19:53:51,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:50" (2/3) ... [2022-11-02 19:53:51,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96c6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:53:51, skipping insertion in model container [2022-11-02 19:53:51,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:51" (3/3) ... [2022-11-02 19:53:51,989 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2022-11-02 19:53:52,001 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 19:53:52,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:53:52,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 19:53:52,015 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 19:53:52,133 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 19:53:52,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-11-02 19:53:52,347 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-11-02 19:53:52,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 19:53:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-02 19:53:52,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2022-11-02 19:53:52,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2022-11-02 19:53:52,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:53:52,405 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;@6a02f39f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:53:52,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 19:53:52,441 INFO L130 PetriNetUnfolder]: 0/80 cut-off events. [2022-11-02 19:53:52,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 19:53:52,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:53:52,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:52,444 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:53:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1381068234, now seen corresponding path program 1 times [2022-11-02 19:53:52,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:52,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575015438] [2022-11-02 19:53:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:53,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575015438] [2022-11-02 19:53:53,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575015438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:53,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:53,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853158610] [2022-11-02 19:53:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:53,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:53,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:53,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:53,406 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 139 [2022-11-02 19:53:53,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 19:53:53,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:53:53,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 139 [2022-11-02 19:53:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:53:53,679 INFO L130 PetriNetUnfolder]: 37/322 cut-off events. [2022-11-02 19:53:53,679 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-02 19:53:53,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 322 events. 37/322 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1176 event pairs, 19 based on Foata normal form. 10/310 useless extension candidates. Maximal degree in co-relation 359. Up to 51 conditions per place. [2022-11-02 19:53:53,691 INFO L137 encePairwiseOnDemand]: 134/139 looper letters, 12 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2022-11-02 19:53:53,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 135 transitions, 313 flow [2022-11-02 19:53:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:53:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2022-11-02 19:53:53,719 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9448441247002398 [2022-11-02 19:53:53,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2022-11-02 19:53:53,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2022-11-02 19:53:53,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:53:53,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2022-11-02 19:53:53,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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 19:53:53,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 19:53:53,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 19:53:53,755 INFO L175 Difference]: Start difference. First operand has 146 places, 135 transitions, 282 flow. Second operand 3 states and 394 transitions. [2022-11-02 19:53:53,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 135 transitions, 313 flow [2022-11-02 19:53:53,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 135 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 19:53:53,766 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 274 flow [2022-11-02 19:53:53,769 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2022-11-02 19:53:53,776 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, -4 predicate places. [2022-11-02 19:53:53,777 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 274 flow [2022-11-02 19:53:53,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 19:53:53,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:53:53,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:53,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:53:53,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:53:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2039699673, now seen corresponding path program 1 times [2022-11-02 19:53:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:53,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908285362] [2022-11-02 19:53:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:54,515 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 19:53:54,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:54,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908285362] [2022-11-02 19:53:54,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908285362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:54,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:54,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:53:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59490243] [2022-11-02 19:53:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:54,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:53:54,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:54,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:53:54,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:53:54,532 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 139 [2022-11-02 19:53:54,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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 19:53:54,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:53:54,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 139 [2022-11-02 19:53:54,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:53:55,453 INFO L130 PetriNetUnfolder]: 330/1150 cut-off events. [2022-11-02 19:53:55,454 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-02 19:53:55,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1150 events. 330/1150 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7548 event pairs, 59 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 1722. Up to 257 conditions per place. [2022-11-02 19:53:55,463 INFO L137 encePairwiseOnDemand]: 133/139 looper letters, 19 selfloop transitions, 2 changer transitions 47/168 dead transitions. [2022-11-02 19:53:55,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 168 transitions, 472 flow [2022-11-02 19:53:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:53:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 19:53:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1110 transitions. [2022-11-02 19:53:55,467 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8872901678657075 [2022-11-02 19:53:55,467 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1110 transitions. [2022-11-02 19:53:55,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1110 transitions. [2022-11-02 19:53:55,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:53:55,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1110 transitions. [2022-11-02 19:53:55,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.33333333333333) internal successors, (1110), 9 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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 19:53:55,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states 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 19:53:55,476 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states 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 19:53:55,476 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 9 states and 1110 transitions. [2022-11-02 19:53:55,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 168 transitions, 472 flow [2022-11-02 19:53:55,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 168 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 19:53:55,481 INFO L231 Difference]: Finished difference. Result has 155 places, 117 transitions, 262 flow [2022-11-02 19:53:55,482 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=155, PETRI_TRANSITIONS=117} [2022-11-02 19:53:55,483 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 9 predicate places. [2022-11-02 19:53:55,483 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 117 transitions, 262 flow [2022-11-02 19:53:55,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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 19:53:55,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:53:55,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:55,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 19:53:55,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:53:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 560124009, now seen corresponding path program 1 times [2022-11-02 19:53:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854908777] [2022-11-02 19:53:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:55,767 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 19:53:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:55,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854908777] [2022-11-02 19:53:55,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854908777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:55,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:55,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:53:55,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890590947] [2022-11-02 19:53:55,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:55,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:53:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:55,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:53:55,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:53:55,771 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2022-11-02 19:53:55,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 117 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 19:53:55,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:53:55,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2022-11-02 19:53:55,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:53:57,420 INFO L130 PetriNetUnfolder]: 2005/3843 cut-off events. [2022-11-02 19:53:57,420 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-11-02 19:53:57,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7241 conditions, 3843 events. 2005/3843 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 28608 event pairs, 121 based on Foata normal form. 0/3741 useless extension candidates. Maximal degree in co-relation 7175. Up to 1189 conditions per place. [2022-11-02 19:53:57,458 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 32 selfloop transitions, 7 changer transitions 50/185 dead transitions. [2022-11-02 19:53:57,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 185 transitions, 582 flow [2022-11-02 19:53:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:53:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 19:53:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1231 transitions. [2022-11-02 19:53:57,466 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8856115107913669 [2022-11-02 19:53:57,466 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1231 transitions. [2022-11-02 19:53:57,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1231 transitions. [2022-11-02 19:53:57,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:53:57,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1231 transitions. [2022-11-02 19:53:57,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.1) internal successors, (1231), 10 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states 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 19:53:57,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states 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 19:53:57,476 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states 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 19:53:57,477 INFO L175 Difference]: Start difference. First operand has 155 places, 117 transitions, 262 flow. Second operand 10 states and 1231 transitions. [2022-11-02 19:53:57,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 185 transitions, 582 flow [2022-11-02 19:53:57,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 185 transitions, 566 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-02 19:53:57,505 INFO L231 Difference]: Finished difference. Result has 142 places, 120 transitions, 312 flow [2022-11-02 19:53:57,506 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=312, PETRI_PLACES=142, PETRI_TRANSITIONS=120} [2022-11-02 19:53:57,507 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, -4 predicate places. [2022-11-02 19:53:57,507 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 120 transitions, 312 flow [2022-11-02 19:53:57,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 19:53:57,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:53:57,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:57,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 19:53:57,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:53:57,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash 748444305, now seen corresponding path program 1 times [2022-11-02 19:53:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:57,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113273891] [2022-11-02 19:53:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:57,883 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 19:53:57,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113273891] [2022-11-02 19:53:57,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113273891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:57,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:57,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:53:57,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99107369] [2022-11-02 19:53:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:57,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:53:57,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:57,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:53:57,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:57,889 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2022-11-02 19:53:57,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 120 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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 19:53:57,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:53:57,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2022-11-02 19:53:57,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:53:59,114 INFO L130 PetriNetUnfolder]: 1013/2234 cut-off events. [2022-11-02 19:53:59,115 INFO L131 PetriNetUnfolder]: For 2596/2610 co-relation queries the response was YES. [2022-11-02 19:53:59,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6203 conditions, 2234 events. 1013/2234 cut-off events. For 2596/2610 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15925 event pairs, 69 based on Foata normal form. 60/2260 useless extension candidates. Maximal degree in co-relation 6136. Up to 691 conditions per place. [2022-11-02 19:53:59,142 INFO L137 encePairwiseOnDemand]: 129/139 looper letters, 38 selfloop transitions, 11 changer transitions 39/184 dead transitions. [2022-11-02 19:53:59,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 184 transitions, 789 flow [2022-11-02 19:53:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:53:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 19:53:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1230 transitions. [2022-11-02 19:53:59,147 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8848920863309353 [2022-11-02 19:53:59,147 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1230 transitions. [2022-11-02 19:53:59,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1230 transitions. [2022-11-02 19:53:59,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:53:59,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1230 transitions. [2022-11-02 19:53:59,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 19:53:59,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states 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 19:53:59,158 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states 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 19:53:59,158 INFO L175 Difference]: Start difference. First operand has 142 places, 120 transitions, 312 flow. Second operand 10 states and 1230 transitions. [2022-11-02 19:53:59,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 184 transitions, 789 flow [2022-11-02 19:53:59,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 184 transitions, 764 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-02 19:53:59,175 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 400 flow [2022-11-02 19:53:59,176 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=400, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2022-11-02 19:53:59,177 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 0 predicate places. [2022-11-02 19:53:59,177 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 400 flow [2022-11-02 19:53:59,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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 19:53:59,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:53:59,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:59,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:53:59,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:53:59,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 483814021, now seen corresponding path program 1 times [2022-11-02 19:53:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:59,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333095311] [2022-11-02 19:53:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:59,754 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 19:53:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:59,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333095311] [2022-11-02 19:53:59,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333095311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:59,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:59,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:53:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114522865] [2022-11-02 19:53:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:59,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:53:59,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:59,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:53:59,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:59,759 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 139 [2022-11-02 19:53:59,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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 19:53:59,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:53:59,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 139 [2022-11-02 19:53:59,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:00,845 INFO L130 PetriNetUnfolder]: 811/2459 cut-off events. [2022-11-02 19:54:00,845 INFO L131 PetriNetUnfolder]: For 4350/4969 co-relation queries the response was YES. [2022-11-02 19:54:00,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6530 conditions, 2459 events. 811/2459 cut-off events. For 4350/4969 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20307 event pairs, 134 based on Foata normal form. 46/2442 useless extension candidates. Maximal degree in co-relation 6458. Up to 527 conditions per place. [2022-11-02 19:54:00,882 INFO L137 encePairwiseOnDemand]: 133/139 looper letters, 53 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2022-11-02 19:54:00,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 163 transitions, 604 flow [2022-11-02 19:54:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:54:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 19:54:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2022-11-02 19:54:00,886 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8879753340184995 [2022-11-02 19:54:00,886 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2022-11-02 19:54:00,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2022-11-02 19:54:00,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:00,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2022-11-02 19:54:00,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 19:54:00,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states 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 19:54:00,893 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states 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 19:54:00,893 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 400 flow. Second operand 7 states and 864 transitions. [2022-11-02 19:54:00,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 163 transitions, 604 flow [2022-11-02 19:54:00,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 163 transitions, 535 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-11-02 19:54:00,914 INFO L231 Difference]: Finished difference. Result has 144 places, 128 transitions, 370 flow [2022-11-02 19:54:00,915 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=144, PETRI_TRANSITIONS=128} [2022-11-02 19:54:00,915 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2022-11-02 19:54:00,916 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 128 transitions, 370 flow [2022-11-02 19:54:00,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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 19:54:00,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:00,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:00,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 19:54:00,918 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:54:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash 820091933, now seen corresponding path program 2 times [2022-11-02 19:54:00,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:00,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281681850] [2022-11-02 19:54:00,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:00,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:01,295 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 19:54:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281681850] [2022-11-02 19:54:01,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281681850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:01,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:01,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:54:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794346787] [2022-11-02 19:54:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:01,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:54:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:01,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:54:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:54:01,302 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2022-11-02 19:54:01,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 128 transitions, 370 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states 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 19:54:01,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:01,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2022-11-02 19:54:01,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:02,283 INFO L130 PetriNetUnfolder]: 788/1985 cut-off events. [2022-11-02 19:54:02,283 INFO L131 PetriNetUnfolder]: For 2575/2679 co-relation queries the response was YES. [2022-11-02 19:54:02,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5431 conditions, 1985 events. 788/1985 cut-off events. For 2575/2679 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14608 event pairs, 24 based on Foata normal form. 67/2004 useless extension candidates. Maximal degree in co-relation 5362. Up to 518 conditions per place. [2022-11-02 19:54:02,302 INFO L137 encePairwiseOnDemand]: 129/139 looper letters, 43 selfloop transitions, 15 changer transitions 42/197 dead transitions. [2022-11-02 19:54:02,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 197 transitions, 919 flow [2022-11-02 19:54:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:54:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 19:54:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1353 transitions. [2022-11-02 19:54:02,308 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8848920863309353 [2022-11-02 19:54:02,308 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1353 transitions. [2022-11-02 19:54:02,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1353 transitions. [2022-11-02 19:54:02,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:02,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1353 transitions. [2022-11-02 19:54:02,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.0) internal successors, (1353), 11 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states 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 19:54:02,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 139.0) internal successors, (1668), 12 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states 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 19:54:02,318 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 139.0) internal successors, (1668), 12 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states 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 19:54:02,318 INFO L175 Difference]: Start difference. First operand has 144 places, 128 transitions, 370 flow. Second operand 11 states and 1353 transitions. [2022-11-02 19:54:02,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 197 transitions, 919 flow [2022-11-02 19:54:02,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 197 transitions, 916 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-02 19:54:02,328 INFO L231 Difference]: Finished difference. Result has 159 places, 129 transitions, 468 flow [2022-11-02 19:54:02,328 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=468, PETRI_PLACES=159, PETRI_TRANSITIONS=129} [2022-11-02 19:54:02,332 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 13 predicate places. [2022-11-02 19:54:02,332 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 129 transitions, 468 flow [2022-11-02 19:54:02,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states 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 19:54:02,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:02,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:02,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 19:54:02,336 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:54:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:02,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1168030639, now seen corresponding path program 1 times [2022-11-02 19:54:02,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:02,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346491845] [2022-11-02 19:54:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:02,721 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 19:54:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:02,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346491845] [2022-11-02 19:54:02,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346491845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:02,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:02,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:54:02,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147268210] [2022-11-02 19:54:02,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:02,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:54:02,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:02,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:54:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:54:02,731 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 139 [2022-11-02 19:54:02,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 129 transitions, 468 flow. Second operand has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states 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 19:54:02,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:02,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 139 [2022-11-02 19:54:02,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:03,578 INFO L130 PetriNetUnfolder]: 439/1751 cut-off events. [2022-11-02 19:54:03,579 INFO L131 PetriNetUnfolder]: For 4281/4724 co-relation queries the response was YES. [2022-11-02 19:54:03,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 1751 events. 439/1751 cut-off events. For 4281/4724 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 13490 event pairs, 105 based on Foata normal form. 59/1705 useless extension candidates. Maximal degree in co-relation 4597. Up to 366 conditions per place. [2022-11-02 19:54:03,605 INFO L137 encePairwiseOnDemand]: 133/139 looper letters, 37 selfloop transitions, 2 changer transitions 19/168 dead transitions. [2022-11-02 19:54:03,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 168 transitions, 694 flow [2022-11-02 19:54:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:54:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 19:54:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2022-11-02 19:54:03,610 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8879753340184995 [2022-11-02 19:54:03,610 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2022-11-02 19:54:03,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2022-11-02 19:54:03,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:03,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2022-11-02 19:54:03,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 19:54:03,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states 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 19:54:03,619 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states 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 19:54:03,619 INFO L175 Difference]: Start difference. First operand has 159 places, 129 transitions, 468 flow. Second operand 7 states and 864 transitions. [2022-11-02 19:54:03,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 168 transitions, 694 flow [2022-11-02 19:54:03,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 168 transitions, 587 flow, removed 40 selfloop flow, removed 13 redundant places. [2022-11-02 19:54:03,652 INFO L231 Difference]: Finished difference. Result has 150 places, 130 transitions, 396 flow [2022-11-02 19:54:03,652 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=150, PETRI_TRANSITIONS=130} [2022-11-02 19:54:03,653 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 4 predicate places. [2022-11-02 19:54:03,654 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 130 transitions, 396 flow [2022-11-02 19:54:03,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states 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 19:54:03,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:03,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:03,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 19:54:03,657 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:54:03,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash -210472889, now seen corresponding path program 2 times [2022-11-02 19:54:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:03,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106112654] [2022-11-02 19:54:03,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:03,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:04,259 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 19:54:04,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:04,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106112654] [2022-11-02 19:54:04,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106112654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:04,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:04,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:54:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699928563] [2022-11-02 19:54:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:04,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:54:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:54:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:54:04,264 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2022-11-02 19:54:04,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 130 transitions, 396 flow. Second operand has 9 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states 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 19:54:04,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:04,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2022-11-02 19:54:04,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:05,363 INFO L130 PetriNetUnfolder]: 670/1849 cut-off events. [2022-11-02 19:54:05,364 INFO L131 PetriNetUnfolder]: For 1941/2041 co-relation queries the response was YES. [2022-11-02 19:54:05,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 1849 events. 670/1849 cut-off events. For 1941/2041 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13853 event pairs, 79 based on Foata normal form. 64/1793 useless extension candidates. Maximal degree in co-relation 4602. Up to 327 conditions per place. [2022-11-02 19:54:05,381 INFO L137 encePairwiseOnDemand]: 129/139 looper letters, 26 selfloop transitions, 19 changer transitions 28/171 dead transitions. [2022-11-02 19:54:05,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 171 transitions, 733 flow [2022-11-02 19:54:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 19:54:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 19:54:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1443 transitions. [2022-11-02 19:54:05,387 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8651079136690647 [2022-11-02 19:54:05,387 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1443 transitions. [2022-11-02 19:54:05,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1443 transitions. [2022-11-02 19:54:05,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:05,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1443 transitions. [2022-11-02 19:54:05,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 120.25) internal successors, (1443), 12 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states 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 19:54:05,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 139.0) internal successors, (1807), 13 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states 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 19:54:05,403 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 139.0) internal successors, (1807), 13 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states 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 19:54:05,403 INFO L175 Difference]: Start difference. First operand has 150 places, 130 transitions, 396 flow. Second operand 12 states and 1443 transitions. [2022-11-02 19:54:05,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 171 transitions, 733 flow [2022-11-02 19:54:05,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 171 transitions, 698 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-11-02 19:54:05,418 INFO L231 Difference]: Finished difference. Result has 159 places, 130 transitions, 440 flow [2022-11-02 19:54:05,419 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=440, PETRI_PLACES=159, PETRI_TRANSITIONS=130} [2022-11-02 19:54:05,422 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 13 predicate places. [2022-11-02 19:54:05,423 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 130 transitions, 440 flow [2022-11-02 19:54:05,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states 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 19:54:05,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:05,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:05,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 19:54:05,426 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:54:05,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:05,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1367003870, now seen corresponding path program 1 times [2022-11-02 19:54:05,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:05,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808396472] [2022-11-02 19:54:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:05,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:05,871 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 19:54:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:05,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808396472] [2022-11-02 19:54:05,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808396472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:05,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:05,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:54:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416549223] [2022-11-02 19:54:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:05,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:54:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:54:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:54:05,875 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 139 [2022-11-02 19:54:05,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 130 transitions, 440 flow. Second operand has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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 19:54:05,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:05,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 139 [2022-11-02 19:54:05,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:06,738 INFO L130 PetriNetUnfolder]: 696/2236 cut-off events. [2022-11-02 19:54:06,739 INFO L131 PetriNetUnfolder]: For 2162/2390 co-relation queries the response was YES. [2022-11-02 19:54:06,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5532 conditions, 2236 events. 696/2236 cut-off events. For 2162/2390 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 18957 event pairs, 84 based on Foata normal form. 1/2136 useless extension candidates. Maximal degree in co-relation 5451. Up to 453 conditions per place. [2022-11-02 19:54:06,767 INFO L137 encePairwiseOnDemand]: 127/139 looper letters, 28 selfloop transitions, 9 changer transitions 10/149 dead transitions. [2022-11-02 19:54:06,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 149 transitions, 594 flow [2022-11-02 19:54:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:54:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 19:54:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 907 transitions. [2022-11-02 19:54:06,770 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8156474820143885 [2022-11-02 19:54:06,771 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 907 transitions. [2022-11-02 19:54:06,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 907 transitions. [2022-11-02 19:54:06,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:06,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 907 transitions. [2022-11-02 19:54:06,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.375) internal successors, (907), 8 states have internal predecessors, (907), 0 states have call successors, (0), 0 states 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 19:54:06,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 139.0) internal successors, (1251), 9 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states 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 19:54:06,778 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 139.0) internal successors, (1251), 9 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states 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 19:54:06,778 INFO L175 Difference]: Start difference. First operand has 159 places, 130 transitions, 440 flow. Second operand 8 states and 907 transitions. [2022-11-02 19:54:06,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 149 transitions, 594 flow [2022-11-02 19:54:06,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 149 transitions, 476 flow, removed 27 selfloop flow, removed 17 redundant places. [2022-11-02 19:54:06,814 INFO L231 Difference]: Finished difference. Result has 150 places, 135 transitions, 387 flow [2022-11-02 19:54:06,815 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=150, PETRI_TRANSITIONS=135} [2022-11-02 19:54:06,816 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 4 predicate places. [2022-11-02 19:54:06,816 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 135 transitions, 387 flow [2022-11-02 19:54:06,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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 19:54:06,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:06,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:06,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 19:54:06,818 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:54:06,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash 332079816, now seen corresponding path program 2 times [2022-11-02 19:54:06,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:06,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544168387] [2022-11-02 19:54:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:07,764 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 19:54:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:07,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544168387] [2022-11-02 19:54:07,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544168387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:07,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:07,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:54:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320727538] [2022-11-02 19:54:07,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:07,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:54:07,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:07,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:54:07,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:54:07,768 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2022-11-02 19:54:07,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 135 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 107.33333333333333) internal successors, (966), 9 states have internal predecessors, (966), 0 states have call successors, (0), 0 states 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 19:54:07,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:07,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2022-11-02 19:54:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:08,581 INFO L130 PetriNetUnfolder]: 623/2269 cut-off events. [2022-11-02 19:54:08,581 INFO L131 PetriNetUnfolder]: For 748/763 co-relation queries the response was YES. [2022-11-02 19:54:08,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 2269 events. 623/2269 cut-off events. For 748/763 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20410 event pairs, 38 based on Foata normal form. 2/2172 useless extension candidates. Maximal degree in co-relation 4252. Up to 346 conditions per place. [2022-11-02 19:54:08,614 INFO L137 encePairwiseOnDemand]: 124/139 looper letters, 53 selfloop transitions, 15 changer transitions 6/172 dead transitions. [2022-11-02 19:54:08,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 172 transitions, 729 flow [2022-11-02 19:54:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:54:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 19:54:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1202 transitions. [2022-11-02 19:54:08,619 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7861347285807717 [2022-11-02 19:54:08,619 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1202 transitions. [2022-11-02 19:54:08,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1202 transitions. [2022-11-02 19:54:08,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:08,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1202 transitions. [2022-11-02 19:54:08,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 109.27272727272727) internal successors, (1202), 11 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states 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 19:54:08,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 139.0) internal successors, (1668), 12 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states 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 19:54:08,629 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 139.0) internal successors, (1668), 12 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states 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 19:54:08,629 INFO L175 Difference]: Start difference. First operand has 150 places, 135 transitions, 387 flow. Second operand 11 states and 1202 transitions. [2022-11-02 19:54:08,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 172 transitions, 729 flow [2022-11-02 19:54:08,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 172 transitions, 710 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-11-02 19:54:08,639 INFO L231 Difference]: Finished difference. Result has 157 places, 146 transitions, 497 flow [2022-11-02 19:54:08,641 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=497, PETRI_PLACES=157, PETRI_TRANSITIONS=146} [2022-11-02 19:54:08,642 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 11 predicate places. [2022-11-02 19:54:08,642 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 146 transitions, 497 flow [2022-11-02 19:54:08,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.33333333333333) internal successors, (966), 9 states have internal predecessors, (966), 0 states have call successors, (0), 0 states 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 19:54:08,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:08,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:08,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 19:54:08,644 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:54:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1576970552, now seen corresponding path program 3 times [2022-11-02 19:54:08,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:08,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646822642] [2022-11-02 19:54:08,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:08,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:10,035 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 19:54:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:10,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646822642] [2022-11-02 19:54:10,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646822642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:10,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:10,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 19:54:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728115996] [2022-11-02 19:54:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:10,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:54:10,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:10,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:54:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:54:10,040 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-11-02 19:54:10,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 146 transitions, 497 flow. Second operand has 10 states, 10 states have (on average 114.2) internal successors, (1142), 10 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states 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 19:54:10,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:10,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-11-02 19:54:10,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:10,983 INFO L130 PetriNetUnfolder]: 785/3155 cut-off events. [2022-11-02 19:54:10,984 INFO L131 PetriNetUnfolder]: For 1061/1150 co-relation queries the response was YES. [2022-11-02 19:54:11,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5730 conditions, 3155 events. 785/3155 cut-off events. For 1061/1150 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 32362 event pairs, 46 based on Foata normal form. 23/2991 useless extension candidates. Maximal degree in co-relation 5711. Up to 554 conditions per place. [2022-11-02 19:54:11,012 INFO L137 encePairwiseOnDemand]: 130/139 looper letters, 27 selfloop transitions, 9 changer transitions 16/165 dead transitions. [2022-11-02 19:54:11,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 165 transitions, 692 flow [2022-11-02 19:54:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:54:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 19:54:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1158 transitions. [2022-11-02 19:54:11,016 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8330935251798561 [2022-11-02 19:54:11,016 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1158 transitions. [2022-11-02 19:54:11,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1158 transitions. [2022-11-02 19:54:11,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:11,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1158 transitions. [2022-11-02 19:54:11,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.8) internal successors, (1158), 10 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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 19:54:11,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states 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 19:54:11,025 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states 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 19:54:11,025 INFO L175 Difference]: Start difference. First operand has 157 places, 146 transitions, 497 flow. Second operand 10 states and 1158 transitions. [2022-11-02 19:54:11,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 165 transitions, 692 flow [2022-11-02 19:54:11,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 165 transitions, 669 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-02 19:54:11,033 INFO L231 Difference]: Finished difference. Result has 165 places, 146 transitions, 528 flow [2022-11-02 19:54:11,034 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=528, PETRI_PLACES=165, PETRI_TRANSITIONS=146} [2022-11-02 19:54:11,035 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 19 predicate places. [2022-11-02 19:54:11,035 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 146 transitions, 528 flow [2022-11-02 19:54:11,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.2) internal successors, (1142), 10 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states 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 19:54:11,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:11,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:11,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 19:54:11,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 19:54:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash -700398428, now seen corresponding path program 4 times [2022-11-02 19:54:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:11,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303069549] [2022-11-02 19:54:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:11,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:54:11,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 19:54:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:54:11,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 19:54:11,240 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 19:54:11,242 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-02 19:54:11,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 19:54:11,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-02 19:54:11,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-02 19:54:11,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-02 19:54:11,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-02 19:54:11,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 19:54:11,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 19:54:11,246 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1] [2022-11-02 19:54:11,253 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 19:54:11,253 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 19:54:11,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:54:11 BasicIcfg [2022-11-02 19:54:11,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 19:54:11,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 19:54:11,500 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 19:54:11,500 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 19:54:11,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:51" (3/4) ... [2022-11-02 19:54:11,502 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 19:54:11,700 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 19:54:11,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 19:54:11,701 INFO L158 Benchmark]: Toolchain (without parser) took 22325.95ms. Allocated memory was 104.9MB in the beginning and 742.4MB in the end (delta: 637.5MB). Free memory was 67.5MB in the beginning and 458.6MB in the end (delta: -391.1MB). Peak memory consumption was 246.6MB. Max. memory is 16.1GB. [2022-11-02 19:54:11,701 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:54:11,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.04ms. Allocated memory is still 104.9MB. Free memory was 67.3MB in the beginning and 66.9MB in the end (delta: 388.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 19:54:11,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.94ms. Allocated memory is still 104.9MB. Free memory was 66.9MB in the beginning and 64.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 19:54:11,703 INFO L158 Benchmark]: Boogie Preprocessor took 42.24ms. Allocated memory is still 104.9MB. Free memory was 64.1MB in the beginning and 62.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:54:11,703 INFO L158 Benchmark]: RCFGBuilder took 1843.33ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 62.0MB in the beginning and 70.4MB in the end (delta: -8.4MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2022-11-02 19:54:11,703 INFO L158 Benchmark]: TraceAbstraction took 19518.86ms. Allocated memory was 130.0MB in the beginning and 742.4MB in the end (delta: 612.4MB). Free memory was 69.5MB in the beginning and 510.0MB in the end (delta: -440.5MB). Peak memory consumption was 173.6MB. Max. memory is 16.1GB. [2022-11-02 19:54:11,704 INFO L158 Benchmark]: Witness Printer took 201.03ms. Allocated memory is still 742.4MB. Free memory was 510.0MB in the beginning and 458.6MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-11-02 19:54:11,706 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.35ms. Allocated memory is still 104.9MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.04ms. Allocated memory is still 104.9MB. Free memory was 67.3MB in the beginning and 66.9MB in the end (delta: 388.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.94ms. Allocated memory is still 104.9MB. Free memory was 66.9MB in the beginning and 64.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.24ms. Allocated memory is still 104.9MB. Free memory was 64.1MB in the beginning and 62.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1843.33ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 62.0MB in the beginning and 70.4MB in the end (delta: -8.4MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19518.86ms. Allocated memory was 130.0MB in the beginning and 742.4MB in the end (delta: 612.4MB). Free memory was 69.5MB in the beginning and 510.0MB in the end (delta: -440.5MB). Peak memory consumption was 173.6MB. Max. memory is 16.1GB. * Witness Printer took 201.03ms. Allocated memory is still 742.4MB. Free memory was 510.0MB in the beginning and 458.6MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L724] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L725] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L726] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L728] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L731] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L732] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L733] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L734] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L735] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L736] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L737] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L738] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L739] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L740] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L741] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L742] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L743] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L744] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L745] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L746] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L747] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L748] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L752] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L863] 0 pthread_t t941; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t941, ((void *)0), P0, ((void *)0))=-3, t941={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L865] 0 pthread_t t942; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t942, ((void *)0), P1, ((void *)0))=-2, t941={5:0}, t942={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L867] 0 pthread_t t943; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t943, ((void *)0), P2, ((void *)0))=-1, t941={5:0}, t942={6:0}, t943={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L869] 0 pthread_t t944; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t944, ((void *)0), P3, ((void *)0))=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 870]: 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: 866]: 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: 868]: 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 9 procedures, 175 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: 19.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1119 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1483 IncrementalHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 116 mSDtfsCounter, 1483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=11, InterpolantAutomatonStates: 98, 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.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1177 NumberOfCodeBlocks, 1177 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 3677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 19:54:11,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc326bc7-cdd2-4c84-a020-4d00870ffdc0/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE