./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.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_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/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_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/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_98a51dc7-c747-4a63-851b-dd438efd456f/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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:25:42,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:25:42,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:25:42,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:25:42,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:25:42,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:25:42,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:25:42,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:25:42,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:25:42,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:25:42,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:25:42,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:25:42,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:25:42,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:25:42,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:25:42,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:25:42,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:25:42,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:25:42,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:25:42,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:25:42,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:25:42,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:25:42,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:25:42,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:25:42,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:25:42,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:25:42,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:25:42,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:25:42,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:25:42,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:25:42,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:25:42,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:25:42,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:25:42,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:25:42,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:25:42,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:25:42,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:25:42,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:25:42,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:25:42,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:25:42,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:25:42,310 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:25:42,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:25:42,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:25:42,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:25:42,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:25:42,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:25:42,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:25:42,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:25:42,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:25:42,369 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:25:42,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:25:42,371 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:25:42,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:25:42,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:25:42,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:25:42,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:25:42,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:25:42,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:25:42,373 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:25:42,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:25:42,374 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:25:42,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:25:42,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:25:42,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:25:42,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:25:42,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:25:42,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:25:42,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:25:42,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:25:42,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:25:42,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:25:42,377 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:25:42,377 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:25:42,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:25:42,378 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_98a51dc7-c747-4a63-851b-dd438efd456f/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_98a51dc7-c747-4a63-851b-dd438efd456f/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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2022-11-02 20:25:42,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:25:42,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:25:42,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:25:42,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:25:42,808 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:25:42,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-02 20:25:42,901 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/data/50dbdd332/c3c3582e42284449ad2b1d2bd05f6e77/FLAGe99ae1c42 [2022-11-02 20:25:43,778 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:25:43,780 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-02 20:25:43,806 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/data/50dbdd332/c3c3582e42284449ad2b1d2bd05f6e77/FLAGe99ae1c42 [2022-11-02 20:25:43,940 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/data/50dbdd332/c3c3582e42284449ad2b1d2bd05f6e77 [2022-11-02 20:25:43,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:25:43,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:25:43,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:25:43,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:25:43,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:25:43,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:25:43" (1/1) ... [2022-11-02 20:25:43,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16aa4c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:43, skipping insertion in model container [2022-11-02 20:25:43,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:25:43" (1/1) ... [2022-11-02 20:25:43,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:25:44,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:25:44,321 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_98a51dc7-c747-4a63-851b-dd438efd456f/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-02 20:25:44,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:25:44,666 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:25:44,694 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_98a51dc7-c747-4a63-851b-dd438efd456f/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-02 20:25:44,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:25:44,824 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:25:44,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44 WrapperNode [2022-11-02 20:25:44,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:25:44,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:25:44,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:25:44,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:25:44,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,893 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 185 [2022-11-02 20:25:44,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:25:44,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:25:44,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:25:44,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:25:44,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,938 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:25:44,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:25:44,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:25:44,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:25:44,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (1/1) ... [2022-11-02 20:25:44,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:25:44,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:25:45,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:25:45,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:25:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:25:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:25:45,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:25:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:25:45,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:25:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 20:25:45,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 20:25:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:25:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:25:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:25:45,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:25:45,086 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:25:45,336 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:25:45,339 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:25:46,371 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:25:47,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:25:47,013 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:25:47,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:25:47 BoogieIcfgContainer [2022-11-02 20:25:47,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:25:47,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:25:47,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:25:47,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:25:47,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:25:43" (1/3) ... [2022-11-02 20:25:47,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670ec1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:25:47, skipping insertion in model container [2022-11-02 20:25:47,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:25:44" (2/3) ... [2022-11-02 20:25:47,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670ec1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:25:47, skipping insertion in model container [2022-11-02 20:25:47,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:25:47" (3/3) ... [2022-11-02 20:25:47,031 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-02 20:25:47,043 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:25:47,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:25:47,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:25:47,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:25:47,180 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:25:47,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-11-02 20:25:47,370 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-11-02 20:25:47,371 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:25:47,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-02 20:25:47,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2022-11-02 20:25:47,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2022-11-02 20:25:47,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:25:47,425 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;@a169bcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:25:47,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 20:25:47,460 INFO L130 PetriNetUnfolder]: 0/49 cut-off events. [2022-11-02 20:25:47,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:25:47,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:25:47,461 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] [2022-11-02 20:25:47,463 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:25:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash 332434645, now seen corresponding path program 1 times [2022-11-02 20:25:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:47,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002427310] [2022-11-02 20:25:47,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:47,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:48,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002427310] [2022-11-02 20:25:48,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002427310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:48,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:48,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:25:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053919810] [2022-11-02 20:25:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:48,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:25:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:25:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:25:48,262 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2022-11-02 20:25:48,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:25:48,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2022-11-02 20:25:48,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:25:48,601 INFO L130 PetriNetUnfolder]: 58/327 cut-off events. [2022-11-02 20:25:48,601 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-02 20:25:48,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 327 events. 58/327 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1390 event pairs, 44 based on Foata normal form. 18/324 useless extension candidates. Maximal degree in co-relation 401. Up to 79 conditions per place. [2022-11-02 20:25:48,611 INFO L137 encePairwiseOnDemand]: 116/121 looper letters, 14 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2022-11-02 20:25:48,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 287 flow [2022-11-02 20:25:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:25:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:25:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2022-11-02 20:25:48,639 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2022-11-02 20:25:48,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2022-11-02 20:25:48,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2022-11-02 20:25:48,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:25:48,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2022-11-02 20:25:48,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,679 INFO L175 Difference]: Start difference. First operand has 126 places, 118 transitions, 245 flow. Second operand 3 states and 342 transitions. [2022-11-02 20:25:48,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 287 flow [2022-11-02 20:25:48,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 120 transitions, 282 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:25:48,689 INFO L231 Difference]: Finished difference. Result has 123 places, 114 transitions, 238 flow [2022-11-02 20:25:48,692 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=123, PETRI_TRANSITIONS=114} [2022-11-02 20:25:48,697 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2022-11-02 20:25:48,698 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 114 transitions, 238 flow [2022-11-02 20:25:48,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:48,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:25:48,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:48,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:25:48,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:25:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash -105635867, now seen corresponding path program 1 times [2022-11-02 20:25:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:48,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388758610] [2022-11-02 20:25:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388758610] [2022-11-02 20:25:49,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388758610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:49,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:49,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:25:49,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750010304] [2022-11-02 20:25:49,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:49,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:25:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:25:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:25:49,465 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 121 [2022-11-02 20:25:49,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:49,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:25:49,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 121 [2022-11-02 20:25:49,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:25:52,573 INFO L130 PetriNetUnfolder]: 3147/7864 cut-off events. [2022-11-02 20:25:52,573 INFO L131 PetriNetUnfolder]: For 285/285 co-relation queries the response was YES. [2022-11-02 20:25:52,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12923 conditions, 7864 events. 3147/7864 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 73191 event pairs, 670 based on Foata normal form. 0/7621 useless extension candidates. Maximal degree in co-relation 12864. Up to 1934 conditions per place. [2022-11-02 20:25:52,632 INFO L137 encePairwiseOnDemand]: 106/121 looper letters, 31 selfloop transitions, 11 changer transitions 82/201 dead transitions. [2022-11-02 20:25:52,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 201 transitions, 656 flow [2022-11-02 20:25:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:25:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:25:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 934 transitions. [2022-11-02 20:25:52,638 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8576675849403123 [2022-11-02 20:25:52,638 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 934 transitions. [2022-11-02 20:25:52,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 934 transitions. [2022-11-02 20:25:52,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:25:52,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 934 transitions. [2022-11-02 20:25:52,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.77777777777777) internal successors, (934), 9 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,649 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,649 INFO L175 Difference]: Start difference. First operand has 123 places, 114 transitions, 238 flow. Second operand 9 states and 934 transitions. [2022-11-02 20:25:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 201 transitions, 656 flow [2022-11-02 20:25:52,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 201 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:25:52,659 INFO L231 Difference]: Finished difference. Result has 137 places, 108 transitions, 328 flow [2022-11-02 20:25:52,660 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=328, PETRI_PLACES=137, PETRI_TRANSITIONS=108} [2022-11-02 20:25:52,661 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2022-11-02 20:25:52,661 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 108 transitions, 328 flow [2022-11-02 20:25:52,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:52,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:25:52,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:52,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:25:52,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:25:52,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1339616836, now seen corresponding path program 1 times [2022-11-02 20:25:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:52,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846115090] [2022-11-02 20:25:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:53,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 20:25:53,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:53,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846115090] [2022-11-02 20:25:53,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846115090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:53,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:53,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96537358] [2022-11-02 20:25:53,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:53,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:53,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:53,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:53,270 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 121 [2022-11-02 20:25:53,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 108 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:53,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:25:53,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 121 [2022-11-02 20:25:53,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:25:55,505 INFO L130 PetriNetUnfolder]: 2093/4029 cut-off events. [2022-11-02 20:25:55,505 INFO L131 PetriNetUnfolder]: For 5878/5908 co-relation queries the response was YES. [2022-11-02 20:25:55,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11796 conditions, 4029 events. 2093/4029 cut-off events. For 5878/5908 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28308 event pairs, 306 based on Foata normal form. 115/4070 useless extension candidates. Maximal degree in co-relation 11721. Up to 1043 conditions per place. [2022-11-02 20:25:55,547 INFO L137 encePairwiseOnDemand]: 109/121 looper letters, 40 selfloop transitions, 9 changer transitions 91/217 dead transitions. [2022-11-02 20:25:55,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 217 transitions, 1168 flow [2022-11-02 20:25:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:25:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:25:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1309 transitions. [2022-11-02 20:25:55,552 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8321678321678322 [2022-11-02 20:25:55,552 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1309 transitions. [2022-11-02 20:25:55,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1309 transitions. [2022-11-02 20:25:55,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:25:55,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1309 transitions. [2022-11-02 20:25:55,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.6923076923077) internal successors, (1309), 13 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:55,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:55,563 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:55,563 INFO L175 Difference]: Start difference. First operand has 137 places, 108 transitions, 328 flow. Second operand 13 states and 1309 transitions. [2022-11-02 20:25:55,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 217 transitions, 1168 flow [2022-11-02 20:25:55,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 217 transitions, 1062 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-11-02 20:25:55,593 INFO L231 Difference]: Finished difference. Result has 141 places, 111 transitions, 392 flow [2022-11-02 20:25:55,594 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=392, PETRI_PLACES=141, PETRI_TRANSITIONS=111} [2022-11-02 20:25:55,597 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 15 predicate places. [2022-11-02 20:25:55,597 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 111 transitions, 392 flow [2022-11-02 20:25:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:55,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:25:55,599 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] [2022-11-02 20:25:55,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:25:55,600 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:25:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1182228948, now seen corresponding path program 1 times [2022-11-02 20:25:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:55,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790596646] [2022-11-02 20:25:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:55,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790596646] [2022-11-02 20:25:56,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790596646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:56,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:56,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:25:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428124503] [2022-11-02 20:25:56,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:56,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:25:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:56,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:25:56,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:25:56,025 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 121 [2022-11-02 20:25:56,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 111 transitions, 392 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:56,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:25:56,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 121 [2022-11-02 20:25:56,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:25:58,056 INFO L130 PetriNetUnfolder]: 1423/3022 cut-off events. [2022-11-02 20:25:58,056 INFO L131 PetriNetUnfolder]: For 6606/6606 co-relation queries the response was YES. [2022-11-02 20:25:58,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9356 conditions, 3022 events. 1423/3022 cut-off events. For 6606/6606 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 21183 event pairs, 364 based on Foata normal form. 75/3025 useless extension candidates. Maximal degree in co-relation 9269. Up to 759 conditions per place. [2022-11-02 20:25:58,099 INFO L137 encePairwiseOnDemand]: 110/121 looper letters, 44 selfloop transitions, 11 changer transitions 67/199 dead transitions. [2022-11-02 20:25:58,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 199 transitions, 1148 flow [2022-11-02 20:25:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:25:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:25:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1294 transitions. [2022-11-02 20:25:58,105 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8226319135410044 [2022-11-02 20:25:58,105 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1294 transitions. [2022-11-02 20:25:58,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1294 transitions. [2022-11-02 20:25:58,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:25:58,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1294 transitions. [2022-11-02 20:25:58,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 13 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,122 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,122 INFO L175 Difference]: Start difference. First operand has 141 places, 111 transitions, 392 flow. Second operand 13 states and 1294 transitions. [2022-11-02 20:25:58,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 199 transitions, 1148 flow [2022-11-02 20:25:58,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 199 transitions, 1063 flow, removed 40 selfloop flow, removed 7 redundant places. [2022-11-02 20:25:58,161 INFO L231 Difference]: Finished difference. Result has 149 places, 116 transitions, 488 flow [2022-11-02 20:25:58,162 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=488, PETRI_PLACES=149, PETRI_TRANSITIONS=116} [2022-11-02 20:25:58,165 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 23 predicate places. [2022-11-02 20:25:58,167 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 116 transitions, 488 flow [2022-11-02 20:25:58,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:25:58,168 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] [2022-11-02 20:25:58,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:25:58,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:25:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1449771001, now seen corresponding path program 1 times [2022-11-02 20:25:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:58,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967919038] [2022-11-02 20:25:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:58,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:58,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:58,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967919038] [2022-11-02 20:25:58,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967919038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:25:58,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:25:58,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:25:58,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711744527] [2022-11-02 20:25:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:25:58,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:25:58,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:25:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:25:58,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:25:58,536 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-02 20:25:58,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 116 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:58,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:25:58,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-02 20:25:58,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:26:00,966 INFO L130 PetriNetUnfolder]: 2793/5657 cut-off events. [2022-11-02 20:26:00,966 INFO L131 PetriNetUnfolder]: For 9365/14760 co-relation queries the response was YES. [2022-11-02 20:26:01,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13628 conditions, 5657 events. 2793/5657 cut-off events. For 9365/14760 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 46128 event pairs, 195 based on Foata normal form. 24/5379 useless extension candidates. Maximal degree in co-relation 13561. Up to 1464 conditions per place. [2022-11-02 20:26:01,054 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 82 selfloop transitions, 17 changer transitions 4/197 dead transitions. [2022-11-02 20:26:01,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 197 transitions, 1084 flow [2022-11-02 20:26:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:26:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:26:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1059 transitions. [2022-11-02 20:26:01,058 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8752066115702479 [2022-11-02 20:26:01,058 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1059 transitions. [2022-11-02 20:26:01,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1059 transitions. [2022-11-02 20:26:01,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:26:01,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1059 transitions. [2022-11-02 20:26:01,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.9) internal successors, (1059), 10 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,066 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,067 INFO L175 Difference]: Start difference. First operand has 149 places, 116 transitions, 488 flow. Second operand 10 states and 1059 transitions. [2022-11-02 20:26:01,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 197 transitions, 1084 flow [2022-11-02 20:26:01,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 197 transitions, 1040 flow, removed 20 selfloop flow, removed 10 redundant places. [2022-11-02 20:26:01,094 INFO L231 Difference]: Finished difference. Result has 145 places, 131 transitions, 564 flow [2022-11-02 20:26:01,095 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=564, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2022-11-02 20:26:01,098 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 19 predicate places. [2022-11-02 20:26:01,098 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 564 flow [2022-11-02 20:26:01,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:26:01,100 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] [2022-11-02 20:26:01,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:26:01,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:26:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash 931878610, now seen corresponding path program 1 times [2022-11-02 20:26:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:01,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963755857] [2022-11-02 20:26:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:01,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:01,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963755857] [2022-11-02 20:26:01,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963755857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:01,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:01,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:26:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612379322] [2022-11-02 20:26:01,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:01,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:26:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:01,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:26:01,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:01,495 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-02 20:26:01,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 564 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:01,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:26:01,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-02 20:26:01,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:26:04,018 INFO L130 PetriNetUnfolder]: 2544/5336 cut-off events. [2022-11-02 20:26:04,018 INFO L131 PetriNetUnfolder]: For 11151/15564 co-relation queries the response was YES. [2022-11-02 20:26:04,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16370 conditions, 5336 events. 2544/5336 cut-off events. For 11151/15564 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 44809 event pairs, 186 based on Foata normal form. 120/5253 useless extension candidates. Maximal degree in co-relation 16281. Up to 829 conditions per place. [2022-11-02 20:26:04,107 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 82 selfloop transitions, 32 changer transitions 26/234 dead transitions. [2022-11-02 20:26:04,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 234 transitions, 1460 flow [2022-11-02 20:26:04,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:26:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:26:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1380 transitions. [2022-11-02 20:26:04,113 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.87730451366815 [2022-11-02 20:26:04,113 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1380 transitions. [2022-11-02 20:26:04,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1380 transitions. [2022-11-02 20:26:04,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:26:04,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1380 transitions. [2022-11-02 20:26:04,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.15384615384616) internal successors, (1380), 13 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:04,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:04,125 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:04,126 INFO L175 Difference]: Start difference. First operand has 145 places, 131 transitions, 564 flow. Second operand 13 states and 1380 transitions. [2022-11-02 20:26:04,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 234 transitions, 1460 flow [2022-11-02 20:26:04,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 234 transitions, 1416 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-11-02 20:26:04,218 INFO L231 Difference]: Finished difference. Result has 154 places, 151 transitions, 793 flow [2022-11-02 20:26:04,219 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=793, PETRI_PLACES=154, PETRI_TRANSITIONS=151} [2022-11-02 20:26:04,223 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 28 predicate places. [2022-11-02 20:26:04,224 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 793 flow [2022-11-02 20:26:04,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:04,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:26:04,225 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] [2022-11-02 20:26:04,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:26:04,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:26:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1760056576, now seen corresponding path program 1 times [2022-11-02 20:26:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:04,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751520334] [2022-11-02 20:26:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:05,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:05,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751520334] [2022-11-02 20:26:05,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751520334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:05,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:05,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:26:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836171727] [2022-11-02 20:26:05,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:05,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:26:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:05,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:26:05,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:26:05,553 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121 [2022-11-02 20:26:05,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 793 flow. Second operand has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:05,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:26:05,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121 [2022-11-02 20:26:05,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:26:06,945 INFO L130 PetriNetUnfolder]: 885/3458 cut-off events. [2022-11-02 20:26:06,945 INFO L131 PetriNetUnfolder]: For 8419/8809 co-relation queries the response was YES. [2022-11-02 20:26:06,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10856 conditions, 3458 events. 885/3458 cut-off events. For 8419/8809 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 37352 event pairs, 35 based on Foata normal form. 8/3292 useless extension candidates. Maximal degree in co-relation 10757. Up to 739 conditions per place. [2022-11-02 20:26:06,997 INFO L137 encePairwiseOnDemand]: 101/121 looper letters, 64 selfloop transitions, 49 changer transitions 15/234 dead transitions. [2022-11-02 20:26:06,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 234 transitions, 1541 flow [2022-11-02 20:26:06,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:26:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:26:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1132 transitions. [2022-11-02 20:26:07,001 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7796143250688705 [2022-11-02 20:26:07,001 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1132 transitions. [2022-11-02 20:26:07,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1132 transitions. [2022-11-02 20:26:07,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:26:07,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1132 transitions. [2022-11-02 20:26:07,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.33333333333333) internal successors, (1132), 12 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:07,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 121.0) internal successors, (1573), 13 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:07,009 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 121.0) internal successors, (1573), 13 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:07,010 INFO L175 Difference]: Start difference. First operand has 154 places, 151 transitions, 793 flow. Second operand 12 states and 1132 transitions. [2022-11-02 20:26:07,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 234 transitions, 1541 flow [2022-11-02 20:26:07,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 234 transitions, 1427 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-11-02 20:26:07,274 INFO L231 Difference]: Finished difference. Result has 166 places, 183 transitions, 1092 flow [2022-11-02 20:26:07,274 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1092, PETRI_PLACES=166, PETRI_TRANSITIONS=183} [2022-11-02 20:26:07,275 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 40 predicate places. [2022-11-02 20:26:07,275 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 183 transitions, 1092 flow [2022-11-02 20:26:07,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:07,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:26:07,276 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] [2022-11-02 20:26:07,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:26:07,276 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:26:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:07,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1958157750, now seen corresponding path program 2 times [2022-11-02 20:26:07,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:07,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355286515] [2022-11-02 20:26:07,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:07,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:07,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355286515] [2022-11-02 20:26:07,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355286515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:07,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:07,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:26:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105077510] [2022-11-02 20:26:07,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:07,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:26:07,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:07,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:26:07,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:07,725 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2022-11-02 20:26:07,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 183 transitions, 1092 flow. Second operand has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:07,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:26:07,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2022-11-02 20:26:07,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:26:09,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L808-->L824: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_318 256) 0)) (.cse21 (= (mod v_~a$r_buff0_thd3~0_246 256) 0)) (.cse26 (= (mod v_~a$r_buff1_thd3~0_169 256) 0))) (let ((.cse20 (= (mod v_~a$w_buff1_used~0_317 256) 0)) (.cse9 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse15 (= (mod v_~a$w_buff0_used~0_433 256) 0)) (.cse29 (not .cse26)) (.cse14 (and .cse31 .cse21)) (.cse16 (and .cse26 .cse21)) (.cse2 (not .cse21)) (.cse30 (= (mod v_~a$w_buff0_used~0_434 256) 0))) (let ((.cse1 (not .cse30)) (.cse3 (or .cse21 .cse30)) (.cse5 (or (not .cse31) .cse2)) (.cse0 (or .cse14 .cse16 .cse30)) (.cse4 (or .cse29 .cse2)) (.cse13 (or .cse15 .cse21)) (.cse7 (not .cse9)) (.cse23 (not .cse20)) (.cse11 (not .cse15))) (and (= v_~weak$$choice2~0_84 |v_P2Thread1of1ForFork0_#t~nondet16_1|) (or (and (= |v_P2_#t~ite17_53| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse0 (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_162)) (and (or (and .cse1 (= |v_P2_#t~ite17_53| v_~a$w_buff0~0_95) .cse2) (and (= |v_P2_#t~ite17_53| v_~a$w_buff1~0_110) .cse3)) (= v_~__unbuffered_p2_EBX~0_16 |v_P2_#t~ite17_53|) .cse4 .cse1 .cse5)) (let ((.cse6 (= |v_P2_#t~ite19_49| |v_P2Thread1of1ForFork0_#t~ite19_1|))) (or (and .cse6 (= v_~a$w_buff0~0_95 v_~a$w_buff0~0_94) (= |v_P2_#t~ite20_45| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse7) (and (or (and .cse6 .cse0 (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_95)) (and (let ((.cse8 (= |v_P2_#t~ite19_49| v_~a$w_buff0~0_95))) (or (and .cse1 .cse8 .cse2) (and .cse8 .cse3))) .cse4 .cse1 (= |v_P2_#t~ite19_49| |v_P2_#t~ite20_45|) .cse5)) (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_94) .cse9))) (let ((.cse10 (= |v_P2_#t~ite28_51| |v_P2Thread1of1ForFork0_#t~ite28_1|))) (or (and (= v_~a$w_buff1_used~0_318 v_~a$w_buff1_used~0_317) .cse10 .cse7 (= |v_P2_#t~ite29_45| |v_P2Thread1of1ForFork0_#t~ite29_1|)) (and (or (and .cse4 (= |v_P2_#t~ite29_45| |v_P2_#t~ite28_51|) .cse11 .cse5 (let ((.cse12 (= |v_P2_#t~ite28_51| 0))) (or (and .cse12 .cse13) (and .cse12 .cse11 .cse2)))) (and (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_318) .cse10 (or .cse14 .cse15 .cse16))) (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_317) .cse9))) (= v_~weak$$choice0~0_17 |v_P2Thread1of1ForFork0_#t~nondet15_1|) (let ((.cse17 (= |v_P2_#t~ite25_55| |v_P2Thread1of1ForFork0_#t~ite25_1|))) (or (and .cse7 (= v_~a$w_buff0_used~0_434 v_~a$w_buff0_used~0_433) .cse17 (= |v_P2_#t~ite26_51| |v_P2Thread1of1ForFork0_#t~ite26_1|)) (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_433) (or (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_434) .cse0 .cse17) (and (or (and .cse1 (= |v_P2_#t~ite25_55| 0) .cse2) (and (= |v_P2_#t~ite25_55| v_~a$w_buff0_used~0_434) .cse3)) .cse4 .cse1 (= |v_P2_#t~ite25_55| |v_P2_#t~ite26_51|) .cse5)) .cse9))) (or (and (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_160) .cse9) (and (= v_~a~0_160 v_~a$mem_tmp~0_26) .cse7)) (= v_~a$flush_delayed~0_38 0) (let ((.cse18 (= |v_P2_#t~ite22_49| |v_P2Thread1of1ForFork0_#t~ite22_1|))) (or (and (= v_~a$w_buff1~0_109 v_~a$w_buff1~0_110) .cse18 (= |v_P2_#t~ite23_43| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse7) (and (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_109) (or (and .cse4 .cse1 (let ((.cse19 (= |v_P2_#t~ite22_49| v_~a$w_buff1~0_110))) (or (and .cse1 .cse19 .cse2) (and .cse19 .cse3))) .cse5 (= |v_P2_#t~ite22_49| |v_P2_#t~ite23_43|)) (and .cse18 (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_110) .cse0)) .cse9))) (let ((.cse22 (= |v_P2_#t~ite31_73| |v_P2Thread1of1ForFork0_#t~ite31_1|))) (or (and (or (and (or .cse15 .cse16 (and .cse20 .cse21)) (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite32_65|) .cse22) (and (= |v_P2_#t~ite31_73| |v_P2_#t~ite32_65|) .cse4 (or (and (= |v_P2_#t~ite31_73| 0) .cse11 .cse2) (and .cse13 (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite31_73|))) .cse11 (or .cse23 .cse2))) (= v_~a$r_buff0_thd3~0_245 |v_P2_#t~ite32_65|) .cse9) (and .cse22 (= |v_P2_#t~ite32_65| |v_P2Thread1of1ForFork0_#t~ite32_1|) .cse7 (= v_~a$r_buff0_thd3~0_246 v_~a$r_buff0_thd3~0_245)))) (= v_~a~0_162 v_~a$mem_tmp~0_26) (let ((.cse24 (= |v_P2_#t~ite34_61| |v_P2Thread1of1ForFork0_#t~ite34_1|))) (or (and (= v_~a$r_buff1_thd3~0_168 v_~a$r_buff1_thd3~0_169) .cse24 .cse7 (= |v_P2_#t~ite35_53| |v_P2Thread1of1ForFork0_#t~ite35_1|)) (and (= v_~a$r_buff1_thd3~0_168 |v_P2_#t~ite35_53|) (let ((.cse25 (= (mod v_~a$r_buff0_thd3~0_245 256) 0))) (or (and .cse24 (= v_~a$r_buff1_thd3~0_169 |v_P2_#t~ite35_53|) (or .cse15 (and .cse25 .cse20) (and .cse25 .cse26))) (let ((.cse27 (not .cse25))) (and (or .cse27 .cse23) (let ((.cse28 (= |v_P2_#t~ite34_61| 0))) (or (and .cse27 .cse28 .cse11) (and (or .cse25 .cse15) .cse28))) (= |v_P2_#t~ite34_61| |v_P2_#t~ite35_53|) (or .cse29 .cse27) .cse11)))) .cse9))))))) InVars {~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_169, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_434, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_246, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_1|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, P2Thread1of1ForFork0_#t~nondet16=|v_P2Thread1of1ForFork0_#t~nondet16_1|, P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_1|, ~a~0=v_~a~0_162, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_1|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_1|, ~a$w_buff0~0=v_~a$w_buff0~0_95, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_1|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_318, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_168, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_433, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_245, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_1|, P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_1|, ~a~0=v_~a~0_160, ~a$mem_tmp~0=v_~a$mem_tmp~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_17, P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_1|, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_1|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_109, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_94, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_317, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[|v_P2_#t~ite25_55|, |v_P2_#t~ite28_51|, |v_P2_#t~ite23_43|, |v_P2_#t~ite29_45|, |v_P2_#t~ite26_51|, |v_P2_#t~ite35_53|, |v_P2_#t~ite31_73|, |v_P2_#t~ite17_53|, |v_P2_#t~ite34_61|, |v_P2_#t~ite32_65|, |v_P2_#t~ite20_45|, |v_P2_#t~ite22_49|, |v_P2_#t~ite19_49|] AssignedVars[P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite25, ~a~0, ~a$mem_tmp~0, P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite21, ~a$w_buff1~0, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, P2Thread1of1ForFork0_#t~ite29, ~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet15, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~nondet16, P2Thread1of1ForFork0_#t~ite37, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite36, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite33, ~a$flush_delayed~0, ~a$w_buff0~0, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~ite19][180], [P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 161#true, Black: 163#(= ~__unbuffered_p2_EAX~0 0), 20#L788true, Black: 278#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 260#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 242#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 274#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 256#true, Black: 143#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 145#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 149#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 199#(= ~__unbuffered_p0_EAX~0 0), 26#L824true, 298#(and (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), 70#L2true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 97#L775true, 197#true, Black: 288#(and (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), Black: 302#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 294#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 304#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 300#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 296#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 287#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 236#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 233#true, P2Thread1of1ForFork0InUse, Black: 164#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 244#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-02 20:26:09,845 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:26:09,846 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:26:09,846 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:26:09,846 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:26:10,037 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L808-->L824: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_318 256) 0)) (.cse21 (= (mod v_~a$r_buff0_thd3~0_246 256) 0)) (.cse26 (= (mod v_~a$r_buff1_thd3~0_169 256) 0))) (let ((.cse20 (= (mod v_~a$w_buff1_used~0_317 256) 0)) (.cse9 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse15 (= (mod v_~a$w_buff0_used~0_433 256) 0)) (.cse29 (not .cse26)) (.cse14 (and .cse31 .cse21)) (.cse16 (and .cse26 .cse21)) (.cse2 (not .cse21)) (.cse30 (= (mod v_~a$w_buff0_used~0_434 256) 0))) (let ((.cse1 (not .cse30)) (.cse3 (or .cse21 .cse30)) (.cse5 (or (not .cse31) .cse2)) (.cse0 (or .cse14 .cse16 .cse30)) (.cse4 (or .cse29 .cse2)) (.cse13 (or .cse15 .cse21)) (.cse7 (not .cse9)) (.cse23 (not .cse20)) (.cse11 (not .cse15))) (and (= v_~weak$$choice2~0_84 |v_P2Thread1of1ForFork0_#t~nondet16_1|) (or (and (= |v_P2_#t~ite17_53| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse0 (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_162)) (and (or (and .cse1 (= |v_P2_#t~ite17_53| v_~a$w_buff0~0_95) .cse2) (and (= |v_P2_#t~ite17_53| v_~a$w_buff1~0_110) .cse3)) (= v_~__unbuffered_p2_EBX~0_16 |v_P2_#t~ite17_53|) .cse4 .cse1 .cse5)) (let ((.cse6 (= |v_P2_#t~ite19_49| |v_P2Thread1of1ForFork0_#t~ite19_1|))) (or (and .cse6 (= v_~a$w_buff0~0_95 v_~a$w_buff0~0_94) (= |v_P2_#t~ite20_45| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse7) (and (or (and .cse6 .cse0 (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_95)) (and (let ((.cse8 (= |v_P2_#t~ite19_49| v_~a$w_buff0~0_95))) (or (and .cse1 .cse8 .cse2) (and .cse8 .cse3))) .cse4 .cse1 (= |v_P2_#t~ite19_49| |v_P2_#t~ite20_45|) .cse5)) (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_94) .cse9))) (let ((.cse10 (= |v_P2_#t~ite28_51| |v_P2Thread1of1ForFork0_#t~ite28_1|))) (or (and (= v_~a$w_buff1_used~0_318 v_~a$w_buff1_used~0_317) .cse10 .cse7 (= |v_P2_#t~ite29_45| |v_P2Thread1of1ForFork0_#t~ite29_1|)) (and (or (and .cse4 (= |v_P2_#t~ite29_45| |v_P2_#t~ite28_51|) .cse11 .cse5 (let ((.cse12 (= |v_P2_#t~ite28_51| 0))) (or (and .cse12 .cse13) (and .cse12 .cse11 .cse2)))) (and (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_318) .cse10 (or .cse14 .cse15 .cse16))) (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_317) .cse9))) (= v_~weak$$choice0~0_17 |v_P2Thread1of1ForFork0_#t~nondet15_1|) (let ((.cse17 (= |v_P2_#t~ite25_55| |v_P2Thread1of1ForFork0_#t~ite25_1|))) (or (and .cse7 (= v_~a$w_buff0_used~0_434 v_~a$w_buff0_used~0_433) .cse17 (= |v_P2_#t~ite26_51| |v_P2Thread1of1ForFork0_#t~ite26_1|)) (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_433) (or (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_434) .cse0 .cse17) (and (or (and .cse1 (= |v_P2_#t~ite25_55| 0) .cse2) (and (= |v_P2_#t~ite25_55| v_~a$w_buff0_used~0_434) .cse3)) .cse4 .cse1 (= |v_P2_#t~ite25_55| |v_P2_#t~ite26_51|) .cse5)) .cse9))) (or (and (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_160) .cse9) (and (= v_~a~0_160 v_~a$mem_tmp~0_26) .cse7)) (= v_~a$flush_delayed~0_38 0) (let ((.cse18 (= |v_P2_#t~ite22_49| |v_P2Thread1of1ForFork0_#t~ite22_1|))) (or (and (= v_~a$w_buff1~0_109 v_~a$w_buff1~0_110) .cse18 (= |v_P2_#t~ite23_43| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse7) (and (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_109) (or (and .cse4 .cse1 (let ((.cse19 (= |v_P2_#t~ite22_49| v_~a$w_buff1~0_110))) (or (and .cse1 .cse19 .cse2) (and .cse19 .cse3))) .cse5 (= |v_P2_#t~ite22_49| |v_P2_#t~ite23_43|)) (and .cse18 (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_110) .cse0)) .cse9))) (let ((.cse22 (= |v_P2_#t~ite31_73| |v_P2Thread1of1ForFork0_#t~ite31_1|))) (or (and (or (and (or .cse15 .cse16 (and .cse20 .cse21)) (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite32_65|) .cse22) (and (= |v_P2_#t~ite31_73| |v_P2_#t~ite32_65|) .cse4 (or (and (= |v_P2_#t~ite31_73| 0) .cse11 .cse2) (and .cse13 (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite31_73|))) .cse11 (or .cse23 .cse2))) (= v_~a$r_buff0_thd3~0_245 |v_P2_#t~ite32_65|) .cse9) (and .cse22 (= |v_P2_#t~ite32_65| |v_P2Thread1of1ForFork0_#t~ite32_1|) .cse7 (= v_~a$r_buff0_thd3~0_246 v_~a$r_buff0_thd3~0_245)))) (= v_~a~0_162 v_~a$mem_tmp~0_26) (let ((.cse24 (= |v_P2_#t~ite34_61| |v_P2Thread1of1ForFork0_#t~ite34_1|))) (or (and (= v_~a$r_buff1_thd3~0_168 v_~a$r_buff1_thd3~0_169) .cse24 .cse7 (= |v_P2_#t~ite35_53| |v_P2Thread1of1ForFork0_#t~ite35_1|)) (and (= v_~a$r_buff1_thd3~0_168 |v_P2_#t~ite35_53|) (let ((.cse25 (= (mod v_~a$r_buff0_thd3~0_245 256) 0))) (or (and .cse24 (= v_~a$r_buff1_thd3~0_169 |v_P2_#t~ite35_53|) (or .cse15 (and .cse25 .cse20) (and .cse25 .cse26))) (let ((.cse27 (not .cse25))) (and (or .cse27 .cse23) (let ((.cse28 (= |v_P2_#t~ite34_61| 0))) (or (and .cse27 .cse28 .cse11) (and (or .cse25 .cse15) .cse28))) (= |v_P2_#t~ite34_61| |v_P2_#t~ite35_53|) (or .cse29 .cse27) .cse11)))) .cse9))))))) InVars {~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_169, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_434, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_246, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_1|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, P2Thread1of1ForFork0_#t~nondet16=|v_P2Thread1of1ForFork0_#t~nondet16_1|, P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_1|, ~a~0=v_~a~0_162, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_1|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_1|, ~a$w_buff0~0=v_~a$w_buff0~0_95, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_1|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_318, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_168, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_433, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_245, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_1|, P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_1|, ~a~0=v_~a~0_160, ~a$mem_tmp~0=v_~a$mem_tmp~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_17, P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_1|, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_1|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_109, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_94, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_317, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[|v_P2_#t~ite25_55|, |v_P2_#t~ite28_51|, |v_P2_#t~ite23_43|, |v_P2_#t~ite29_45|, |v_P2_#t~ite26_51|, |v_P2_#t~ite35_53|, |v_P2_#t~ite31_73|, |v_P2_#t~ite17_53|, |v_P2_#t~ite34_61|, |v_P2_#t~ite32_65|, |v_P2_#t~ite20_45|, |v_P2_#t~ite22_49|, |v_P2_#t~ite19_49|] AssignedVars[P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite25, ~a~0, ~a$mem_tmp~0, P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite21, ~a$w_buff1~0, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, P2Thread1of1ForFork0_#t~ite29, ~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet15, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~nondet16, P2Thread1of1ForFork0_#t~ite37, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite36, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite33, ~a$flush_delayed~0, ~a$w_buff0~0, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~ite19][194], [P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 161#true, Black: 163#(= ~__unbuffered_p2_EAX~0 0), 20#L788true, Black: 278#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 260#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 274#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 256#true, Black: 143#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 272#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 149#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 199#(= ~__unbuffered_p0_EAX~0 0), 26#L824true, 298#(and (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), 70#L2true, 246#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 52#L778true, 197#true, Black: 288#(and (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), Black: 302#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 294#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 304#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), 332#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 300#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 296#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 287#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 236#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 233#true, P2Thread1of1ForFork0InUse, Black: 164#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 244#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-02 20:26:10,038 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:26:10,039 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:26:10,039 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:26:10,039 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:26:10,104 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L808-->L824: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_318 256) 0)) (.cse21 (= (mod v_~a$r_buff0_thd3~0_246 256) 0)) (.cse26 (= (mod v_~a$r_buff1_thd3~0_169 256) 0))) (let ((.cse20 (= (mod v_~a$w_buff1_used~0_317 256) 0)) (.cse9 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse15 (= (mod v_~a$w_buff0_used~0_433 256) 0)) (.cse29 (not .cse26)) (.cse14 (and .cse31 .cse21)) (.cse16 (and .cse26 .cse21)) (.cse2 (not .cse21)) (.cse30 (= (mod v_~a$w_buff0_used~0_434 256) 0))) (let ((.cse1 (not .cse30)) (.cse3 (or .cse21 .cse30)) (.cse5 (or (not .cse31) .cse2)) (.cse0 (or .cse14 .cse16 .cse30)) (.cse4 (or .cse29 .cse2)) (.cse13 (or .cse15 .cse21)) (.cse7 (not .cse9)) (.cse23 (not .cse20)) (.cse11 (not .cse15))) (and (= v_~weak$$choice2~0_84 |v_P2Thread1of1ForFork0_#t~nondet16_1|) (or (and (= |v_P2_#t~ite17_53| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse0 (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_162)) (and (or (and .cse1 (= |v_P2_#t~ite17_53| v_~a$w_buff0~0_95) .cse2) (and (= |v_P2_#t~ite17_53| v_~a$w_buff1~0_110) .cse3)) (= v_~__unbuffered_p2_EBX~0_16 |v_P2_#t~ite17_53|) .cse4 .cse1 .cse5)) (let ((.cse6 (= |v_P2_#t~ite19_49| |v_P2Thread1of1ForFork0_#t~ite19_1|))) (or (and .cse6 (= v_~a$w_buff0~0_95 v_~a$w_buff0~0_94) (= |v_P2_#t~ite20_45| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse7) (and (or (and .cse6 .cse0 (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_95)) (and (let ((.cse8 (= |v_P2_#t~ite19_49| v_~a$w_buff0~0_95))) (or (and .cse1 .cse8 .cse2) (and .cse8 .cse3))) .cse4 .cse1 (= |v_P2_#t~ite19_49| |v_P2_#t~ite20_45|) .cse5)) (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_94) .cse9))) (let ((.cse10 (= |v_P2_#t~ite28_51| |v_P2Thread1of1ForFork0_#t~ite28_1|))) (or (and (= v_~a$w_buff1_used~0_318 v_~a$w_buff1_used~0_317) .cse10 .cse7 (= |v_P2_#t~ite29_45| |v_P2Thread1of1ForFork0_#t~ite29_1|)) (and (or (and .cse4 (= |v_P2_#t~ite29_45| |v_P2_#t~ite28_51|) .cse11 .cse5 (let ((.cse12 (= |v_P2_#t~ite28_51| 0))) (or (and .cse12 .cse13) (and .cse12 .cse11 .cse2)))) (and (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_318) .cse10 (or .cse14 .cse15 .cse16))) (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_317) .cse9))) (= v_~weak$$choice0~0_17 |v_P2Thread1of1ForFork0_#t~nondet15_1|) (let ((.cse17 (= |v_P2_#t~ite25_55| |v_P2Thread1of1ForFork0_#t~ite25_1|))) (or (and .cse7 (= v_~a$w_buff0_used~0_434 v_~a$w_buff0_used~0_433) .cse17 (= |v_P2_#t~ite26_51| |v_P2Thread1of1ForFork0_#t~ite26_1|)) (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_433) (or (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_434) .cse0 .cse17) (and (or (and .cse1 (= |v_P2_#t~ite25_55| 0) .cse2) (and (= |v_P2_#t~ite25_55| v_~a$w_buff0_used~0_434) .cse3)) .cse4 .cse1 (= |v_P2_#t~ite25_55| |v_P2_#t~ite26_51|) .cse5)) .cse9))) (or (and (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_160) .cse9) (and (= v_~a~0_160 v_~a$mem_tmp~0_26) .cse7)) (= v_~a$flush_delayed~0_38 0) (let ((.cse18 (= |v_P2_#t~ite22_49| |v_P2Thread1of1ForFork0_#t~ite22_1|))) (or (and (= v_~a$w_buff1~0_109 v_~a$w_buff1~0_110) .cse18 (= |v_P2_#t~ite23_43| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse7) (and (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_109) (or (and .cse4 .cse1 (let ((.cse19 (= |v_P2_#t~ite22_49| v_~a$w_buff1~0_110))) (or (and .cse1 .cse19 .cse2) (and .cse19 .cse3))) .cse5 (= |v_P2_#t~ite22_49| |v_P2_#t~ite23_43|)) (and .cse18 (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_110) .cse0)) .cse9))) (let ((.cse22 (= |v_P2_#t~ite31_73| |v_P2Thread1of1ForFork0_#t~ite31_1|))) (or (and (or (and (or .cse15 .cse16 (and .cse20 .cse21)) (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite32_65|) .cse22) (and (= |v_P2_#t~ite31_73| |v_P2_#t~ite32_65|) .cse4 (or (and (= |v_P2_#t~ite31_73| 0) .cse11 .cse2) (and .cse13 (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite31_73|))) .cse11 (or .cse23 .cse2))) (= v_~a$r_buff0_thd3~0_245 |v_P2_#t~ite32_65|) .cse9) (and .cse22 (= |v_P2_#t~ite32_65| |v_P2Thread1of1ForFork0_#t~ite32_1|) .cse7 (= v_~a$r_buff0_thd3~0_246 v_~a$r_buff0_thd3~0_245)))) (= v_~a~0_162 v_~a$mem_tmp~0_26) (let ((.cse24 (= |v_P2_#t~ite34_61| |v_P2Thread1of1ForFork0_#t~ite34_1|))) (or (and (= v_~a$r_buff1_thd3~0_168 v_~a$r_buff1_thd3~0_169) .cse24 .cse7 (= |v_P2_#t~ite35_53| |v_P2Thread1of1ForFork0_#t~ite35_1|)) (and (= v_~a$r_buff1_thd3~0_168 |v_P2_#t~ite35_53|) (let ((.cse25 (= (mod v_~a$r_buff0_thd3~0_245 256) 0))) (or (and .cse24 (= v_~a$r_buff1_thd3~0_169 |v_P2_#t~ite35_53|) (or .cse15 (and .cse25 .cse20) (and .cse25 .cse26))) (let ((.cse27 (not .cse25))) (and (or .cse27 .cse23) (let ((.cse28 (= |v_P2_#t~ite34_61| 0))) (or (and .cse27 .cse28 .cse11) (and (or .cse25 .cse15) .cse28))) (= |v_P2_#t~ite34_61| |v_P2_#t~ite35_53|) (or .cse29 .cse27) .cse11)))) .cse9))))))) InVars {~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_169, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_434, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_246, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_1|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, P2Thread1of1ForFork0_#t~nondet16=|v_P2Thread1of1ForFork0_#t~nondet16_1|, P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_1|, ~a~0=v_~a~0_162, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_1|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_1|, ~a$w_buff0~0=v_~a$w_buff0~0_95, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_1|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_318, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_168, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_433, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_245, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_1|, P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_1|, ~a~0=v_~a~0_160, ~a$mem_tmp~0=v_~a$mem_tmp~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_17, P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_1|, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_1|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_109, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_94, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_317, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[|v_P2_#t~ite25_55|, |v_P2_#t~ite28_51|, |v_P2_#t~ite23_43|, |v_P2_#t~ite29_45|, |v_P2_#t~ite26_51|, |v_P2_#t~ite35_53|, |v_P2_#t~ite31_73|, |v_P2_#t~ite17_53|, |v_P2_#t~ite34_61|, |v_P2_#t~ite32_65|, |v_P2_#t~ite20_45|, |v_P2_#t~ite22_49|, |v_P2_#t~ite19_49|] AssignedVars[P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite25, ~a~0, ~a$mem_tmp~0, P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite21, ~a$w_buff1~0, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, P2Thread1of1ForFork0_#t~ite29, ~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet15, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~nondet16, P2Thread1of1ForFork0_#t~ite37, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite36, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite33, ~a$flush_delayed~0, ~a$w_buff0~0, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~ite19][213], [P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 161#true, Black: 163#(= ~__unbuffered_p2_EAX~0 0), 20#L788true, Black: 278#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 260#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 274#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 256#true, Black: 143#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 145#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 270#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 149#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 199#(= ~__unbuffered_p0_EAX~0 0), 26#L824true, 298#(and (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), 59#L3true, 97#L775true, 197#true, Black: 288#(and (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), Black: 302#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 294#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 304#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 300#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 296#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 287#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 236#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 233#true, P2Thread1of1ForFork0InUse, Black: 164#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))]) [2022-11-02 20:26:10,105 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:26:10,105 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:26:10,105 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:26:10,105 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:26:10,275 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L808-->L824: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_318 256) 0)) (.cse21 (= (mod v_~a$r_buff0_thd3~0_246 256) 0)) (.cse26 (= (mod v_~a$r_buff1_thd3~0_169 256) 0))) (let ((.cse20 (= (mod v_~a$w_buff1_used~0_317 256) 0)) (.cse9 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse15 (= (mod v_~a$w_buff0_used~0_433 256) 0)) (.cse29 (not .cse26)) (.cse14 (and .cse31 .cse21)) (.cse16 (and .cse26 .cse21)) (.cse2 (not .cse21)) (.cse30 (= (mod v_~a$w_buff0_used~0_434 256) 0))) (let ((.cse1 (not .cse30)) (.cse3 (or .cse21 .cse30)) (.cse5 (or (not .cse31) .cse2)) (.cse0 (or .cse14 .cse16 .cse30)) (.cse4 (or .cse29 .cse2)) (.cse13 (or .cse15 .cse21)) (.cse7 (not .cse9)) (.cse23 (not .cse20)) (.cse11 (not .cse15))) (and (= v_~weak$$choice2~0_84 |v_P2Thread1of1ForFork0_#t~nondet16_1|) (or (and (= |v_P2_#t~ite17_53| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse0 (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_162)) (and (or (and .cse1 (= |v_P2_#t~ite17_53| v_~a$w_buff0~0_95) .cse2) (and (= |v_P2_#t~ite17_53| v_~a$w_buff1~0_110) .cse3)) (= v_~__unbuffered_p2_EBX~0_16 |v_P2_#t~ite17_53|) .cse4 .cse1 .cse5)) (let ((.cse6 (= |v_P2_#t~ite19_49| |v_P2Thread1of1ForFork0_#t~ite19_1|))) (or (and .cse6 (= v_~a$w_buff0~0_95 v_~a$w_buff0~0_94) (= |v_P2_#t~ite20_45| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse7) (and (or (and .cse6 .cse0 (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_95)) (and (let ((.cse8 (= |v_P2_#t~ite19_49| v_~a$w_buff0~0_95))) (or (and .cse1 .cse8 .cse2) (and .cse8 .cse3))) .cse4 .cse1 (= |v_P2_#t~ite19_49| |v_P2_#t~ite20_45|) .cse5)) (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_94) .cse9))) (let ((.cse10 (= |v_P2_#t~ite28_51| |v_P2Thread1of1ForFork0_#t~ite28_1|))) (or (and (= v_~a$w_buff1_used~0_318 v_~a$w_buff1_used~0_317) .cse10 .cse7 (= |v_P2_#t~ite29_45| |v_P2Thread1of1ForFork0_#t~ite29_1|)) (and (or (and .cse4 (= |v_P2_#t~ite29_45| |v_P2_#t~ite28_51|) .cse11 .cse5 (let ((.cse12 (= |v_P2_#t~ite28_51| 0))) (or (and .cse12 .cse13) (and .cse12 .cse11 .cse2)))) (and (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_318) .cse10 (or .cse14 .cse15 .cse16))) (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_317) .cse9))) (= v_~weak$$choice0~0_17 |v_P2Thread1of1ForFork0_#t~nondet15_1|) (let ((.cse17 (= |v_P2_#t~ite25_55| |v_P2Thread1of1ForFork0_#t~ite25_1|))) (or (and .cse7 (= v_~a$w_buff0_used~0_434 v_~a$w_buff0_used~0_433) .cse17 (= |v_P2_#t~ite26_51| |v_P2Thread1of1ForFork0_#t~ite26_1|)) (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_433) (or (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_434) .cse0 .cse17) (and (or (and .cse1 (= |v_P2_#t~ite25_55| 0) .cse2) (and (= |v_P2_#t~ite25_55| v_~a$w_buff0_used~0_434) .cse3)) .cse4 .cse1 (= |v_P2_#t~ite25_55| |v_P2_#t~ite26_51|) .cse5)) .cse9))) (or (and (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_160) .cse9) (and (= v_~a~0_160 v_~a$mem_tmp~0_26) .cse7)) (= v_~a$flush_delayed~0_38 0) (let ((.cse18 (= |v_P2_#t~ite22_49| |v_P2Thread1of1ForFork0_#t~ite22_1|))) (or (and (= v_~a$w_buff1~0_109 v_~a$w_buff1~0_110) .cse18 (= |v_P2_#t~ite23_43| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse7) (and (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_109) (or (and .cse4 .cse1 (let ((.cse19 (= |v_P2_#t~ite22_49| v_~a$w_buff1~0_110))) (or (and .cse1 .cse19 .cse2) (and .cse19 .cse3))) .cse5 (= |v_P2_#t~ite22_49| |v_P2_#t~ite23_43|)) (and .cse18 (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_110) .cse0)) .cse9))) (let ((.cse22 (= |v_P2_#t~ite31_73| |v_P2Thread1of1ForFork0_#t~ite31_1|))) (or (and (or (and (or .cse15 .cse16 (and .cse20 .cse21)) (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite32_65|) .cse22) (and (= |v_P2_#t~ite31_73| |v_P2_#t~ite32_65|) .cse4 (or (and (= |v_P2_#t~ite31_73| 0) .cse11 .cse2) (and .cse13 (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite31_73|))) .cse11 (or .cse23 .cse2))) (= v_~a$r_buff0_thd3~0_245 |v_P2_#t~ite32_65|) .cse9) (and .cse22 (= |v_P2_#t~ite32_65| |v_P2Thread1of1ForFork0_#t~ite32_1|) .cse7 (= v_~a$r_buff0_thd3~0_246 v_~a$r_buff0_thd3~0_245)))) (= v_~a~0_162 v_~a$mem_tmp~0_26) (let ((.cse24 (= |v_P2_#t~ite34_61| |v_P2Thread1of1ForFork0_#t~ite34_1|))) (or (and (= v_~a$r_buff1_thd3~0_168 v_~a$r_buff1_thd3~0_169) .cse24 .cse7 (= |v_P2_#t~ite35_53| |v_P2Thread1of1ForFork0_#t~ite35_1|)) (and (= v_~a$r_buff1_thd3~0_168 |v_P2_#t~ite35_53|) (let ((.cse25 (= (mod v_~a$r_buff0_thd3~0_245 256) 0))) (or (and .cse24 (= v_~a$r_buff1_thd3~0_169 |v_P2_#t~ite35_53|) (or .cse15 (and .cse25 .cse20) (and .cse25 .cse26))) (let ((.cse27 (not .cse25))) (and (or .cse27 .cse23) (let ((.cse28 (= |v_P2_#t~ite34_61| 0))) (or (and .cse27 .cse28 .cse11) (and (or .cse25 .cse15) .cse28))) (= |v_P2_#t~ite34_61| |v_P2_#t~ite35_53|) (or .cse29 .cse27) .cse11)))) .cse9))))))) InVars {~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_169, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_434, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_246, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_1|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, P2Thread1of1ForFork0_#t~nondet16=|v_P2Thread1of1ForFork0_#t~nondet16_1|, P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_1|, ~a~0=v_~a~0_162, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_1|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_1|, ~a$w_buff0~0=v_~a$w_buff0~0_95, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_1|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_318, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_168, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_433, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_245, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_1|, P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_1|, ~a~0=v_~a~0_160, ~a$mem_tmp~0=v_~a$mem_tmp~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_17, P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_1|, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_1|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_109, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_94, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_317, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[|v_P2_#t~ite25_55|, |v_P2_#t~ite28_51|, |v_P2_#t~ite23_43|, |v_P2_#t~ite29_45|, |v_P2_#t~ite26_51|, |v_P2_#t~ite35_53|, |v_P2_#t~ite31_73|, |v_P2_#t~ite17_53|, |v_P2_#t~ite34_61|, |v_P2_#t~ite32_65|, |v_P2_#t~ite20_45|, |v_P2_#t~ite22_49|, |v_P2_#t~ite19_49|] AssignedVars[P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite25, ~a~0, ~a$mem_tmp~0, P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite21, ~a$w_buff1~0, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, P2Thread1of1ForFork0_#t~ite29, ~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet15, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~nondet16, P2Thread1of1ForFork0_#t~ite37, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite36, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite33, ~a$flush_delayed~0, ~a$w_buff0~0, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~ite19][222], [P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 161#true, Black: 163#(= ~__unbuffered_p2_EAX~0 0), 20#L788true, 274#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 278#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 260#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 256#true, Black: 143#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 145#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 149#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 199#(= ~__unbuffered_p0_EAX~0 0), 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 26#L824true, 298#(and (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), 59#L3true, 52#L778true, 197#true, Black: 288#(and (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), Black: 302#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 294#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), 334#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 304#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 300#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 296#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 287#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 236#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 233#true, P2Thread1of1ForFork0InUse, Black: 164#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 244#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-02 20:26:10,275 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:26:10,275 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:26:10,275 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:26:10,275 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:26:10,328 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L808-->L824: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_318 256) 0)) (.cse21 (= (mod v_~a$r_buff0_thd3~0_246 256) 0)) (.cse26 (= (mod v_~a$r_buff1_thd3~0_169 256) 0))) (let ((.cse20 (= (mod v_~a$w_buff1_used~0_317 256) 0)) (.cse9 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse15 (= (mod v_~a$w_buff0_used~0_433 256) 0)) (.cse29 (not .cse26)) (.cse14 (and .cse31 .cse21)) (.cse16 (and .cse26 .cse21)) (.cse2 (not .cse21)) (.cse30 (= (mod v_~a$w_buff0_used~0_434 256) 0))) (let ((.cse1 (not .cse30)) (.cse3 (or .cse21 .cse30)) (.cse5 (or (not .cse31) .cse2)) (.cse0 (or .cse14 .cse16 .cse30)) (.cse4 (or .cse29 .cse2)) (.cse13 (or .cse15 .cse21)) (.cse7 (not .cse9)) (.cse23 (not .cse20)) (.cse11 (not .cse15))) (and (= v_~weak$$choice2~0_84 |v_P2Thread1of1ForFork0_#t~nondet16_1|) (or (and (= |v_P2_#t~ite17_53| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse0 (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_162)) (and (or (and .cse1 (= |v_P2_#t~ite17_53| v_~a$w_buff0~0_95) .cse2) (and (= |v_P2_#t~ite17_53| v_~a$w_buff1~0_110) .cse3)) (= v_~__unbuffered_p2_EBX~0_16 |v_P2_#t~ite17_53|) .cse4 .cse1 .cse5)) (let ((.cse6 (= |v_P2_#t~ite19_49| |v_P2Thread1of1ForFork0_#t~ite19_1|))) (or (and .cse6 (= v_~a$w_buff0~0_95 v_~a$w_buff0~0_94) (= |v_P2_#t~ite20_45| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse7) (and (or (and .cse6 .cse0 (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_95)) (and (let ((.cse8 (= |v_P2_#t~ite19_49| v_~a$w_buff0~0_95))) (or (and .cse1 .cse8 .cse2) (and .cse8 .cse3))) .cse4 .cse1 (= |v_P2_#t~ite19_49| |v_P2_#t~ite20_45|) .cse5)) (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_94) .cse9))) (let ((.cse10 (= |v_P2_#t~ite28_51| |v_P2Thread1of1ForFork0_#t~ite28_1|))) (or (and (= v_~a$w_buff1_used~0_318 v_~a$w_buff1_used~0_317) .cse10 .cse7 (= |v_P2_#t~ite29_45| |v_P2Thread1of1ForFork0_#t~ite29_1|)) (and (or (and .cse4 (= |v_P2_#t~ite29_45| |v_P2_#t~ite28_51|) .cse11 .cse5 (let ((.cse12 (= |v_P2_#t~ite28_51| 0))) (or (and .cse12 .cse13) (and .cse12 .cse11 .cse2)))) (and (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_318) .cse10 (or .cse14 .cse15 .cse16))) (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_317) .cse9))) (= v_~weak$$choice0~0_17 |v_P2Thread1of1ForFork0_#t~nondet15_1|) (let ((.cse17 (= |v_P2_#t~ite25_55| |v_P2Thread1of1ForFork0_#t~ite25_1|))) (or (and .cse7 (= v_~a$w_buff0_used~0_434 v_~a$w_buff0_used~0_433) .cse17 (= |v_P2_#t~ite26_51| |v_P2Thread1of1ForFork0_#t~ite26_1|)) (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_433) (or (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_434) .cse0 .cse17) (and (or (and .cse1 (= |v_P2_#t~ite25_55| 0) .cse2) (and (= |v_P2_#t~ite25_55| v_~a$w_buff0_used~0_434) .cse3)) .cse4 .cse1 (= |v_P2_#t~ite25_55| |v_P2_#t~ite26_51|) .cse5)) .cse9))) (or (and (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_160) .cse9) (and (= v_~a~0_160 v_~a$mem_tmp~0_26) .cse7)) (= v_~a$flush_delayed~0_38 0) (let ((.cse18 (= |v_P2_#t~ite22_49| |v_P2Thread1of1ForFork0_#t~ite22_1|))) (or (and (= v_~a$w_buff1~0_109 v_~a$w_buff1~0_110) .cse18 (= |v_P2_#t~ite23_43| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse7) (and (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_109) (or (and .cse4 .cse1 (let ((.cse19 (= |v_P2_#t~ite22_49| v_~a$w_buff1~0_110))) (or (and .cse1 .cse19 .cse2) (and .cse19 .cse3))) .cse5 (= |v_P2_#t~ite22_49| |v_P2_#t~ite23_43|)) (and .cse18 (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_110) .cse0)) .cse9))) (let ((.cse22 (= |v_P2_#t~ite31_73| |v_P2Thread1of1ForFork0_#t~ite31_1|))) (or (and (or (and (or .cse15 .cse16 (and .cse20 .cse21)) (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite32_65|) .cse22) (and (= |v_P2_#t~ite31_73| |v_P2_#t~ite32_65|) .cse4 (or (and (= |v_P2_#t~ite31_73| 0) .cse11 .cse2) (and .cse13 (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite31_73|))) .cse11 (or .cse23 .cse2))) (= v_~a$r_buff0_thd3~0_245 |v_P2_#t~ite32_65|) .cse9) (and .cse22 (= |v_P2_#t~ite32_65| |v_P2Thread1of1ForFork0_#t~ite32_1|) .cse7 (= v_~a$r_buff0_thd3~0_246 v_~a$r_buff0_thd3~0_245)))) (= v_~a~0_162 v_~a$mem_tmp~0_26) (let ((.cse24 (= |v_P2_#t~ite34_61| |v_P2Thread1of1ForFork0_#t~ite34_1|))) (or (and (= v_~a$r_buff1_thd3~0_168 v_~a$r_buff1_thd3~0_169) .cse24 .cse7 (= |v_P2_#t~ite35_53| |v_P2Thread1of1ForFork0_#t~ite35_1|)) (and (= v_~a$r_buff1_thd3~0_168 |v_P2_#t~ite35_53|) (let ((.cse25 (= (mod v_~a$r_buff0_thd3~0_245 256) 0))) (or (and .cse24 (= v_~a$r_buff1_thd3~0_169 |v_P2_#t~ite35_53|) (or .cse15 (and .cse25 .cse20) (and .cse25 .cse26))) (let ((.cse27 (not .cse25))) (and (or .cse27 .cse23) (let ((.cse28 (= |v_P2_#t~ite34_61| 0))) (or (and .cse27 .cse28 .cse11) (and (or .cse25 .cse15) .cse28))) (= |v_P2_#t~ite34_61| |v_P2_#t~ite35_53|) (or .cse29 .cse27) .cse11)))) .cse9))))))) InVars {~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_169, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_434, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_246, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_1|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, P2Thread1of1ForFork0_#t~nondet16=|v_P2Thread1of1ForFork0_#t~nondet16_1|, P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_1|, ~a~0=v_~a~0_162, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_1|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_1|, ~a$w_buff0~0=v_~a$w_buff0~0_95, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_1|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_318, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_168, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_433, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_245, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_1|, P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_1|, ~a~0=v_~a~0_160, ~a$mem_tmp~0=v_~a$mem_tmp~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_17, P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_1|, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_1|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_109, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_94, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_317, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[|v_P2_#t~ite25_55|, |v_P2_#t~ite28_51|, |v_P2_#t~ite23_43|, |v_P2_#t~ite29_45|, |v_P2_#t~ite26_51|, |v_P2_#t~ite35_53|, |v_P2_#t~ite31_73|, |v_P2_#t~ite17_53|, |v_P2_#t~ite34_61|, |v_P2_#t~ite32_65|, |v_P2_#t~ite20_45|, |v_P2_#t~ite22_49|, |v_P2_#t~ite19_49|] AssignedVars[P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite25, ~a~0, ~a$mem_tmp~0, P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite21, ~a$w_buff1~0, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, P2Thread1of1ForFork0_#t~ite29, ~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet15, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~nondet16, P2Thread1of1ForFork0_#t~ite37, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite36, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite33, ~a$flush_delayed~0, ~a$w_buff0~0, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~ite19][213], [P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 161#true, Black: 163#(= ~__unbuffered_p2_EAX~0 0), 20#L788true, 118#L3-1true, Black: 278#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 260#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 274#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 256#true, Black: 143#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 145#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 270#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 149#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 199#(= ~__unbuffered_p0_EAX~0 0), 26#L824true, 298#(and (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), 97#L775true, 197#true, Black: 288#(and (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), Black: 302#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 294#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 304#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 300#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 296#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 287#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 236#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 233#true, P2Thread1of1ForFork0InUse, Black: 164#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))]) [2022-11-02 20:26:10,328 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:26:10,329 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:26:10,329 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:26:10,329 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:26:10,490 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L808-->L824: Formula: (let ((.cse31 (= (mod v_~a$w_buff1_used~0_318 256) 0)) (.cse21 (= (mod v_~a$r_buff0_thd3~0_246 256) 0)) (.cse26 (= (mod v_~a$r_buff1_thd3~0_169 256) 0))) (let ((.cse20 (= (mod v_~a$w_buff1_used~0_317 256) 0)) (.cse9 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse15 (= (mod v_~a$w_buff0_used~0_433 256) 0)) (.cse29 (not .cse26)) (.cse14 (and .cse31 .cse21)) (.cse16 (and .cse26 .cse21)) (.cse2 (not .cse21)) (.cse30 (= (mod v_~a$w_buff0_used~0_434 256) 0))) (let ((.cse1 (not .cse30)) (.cse3 (or .cse21 .cse30)) (.cse5 (or (not .cse31) .cse2)) (.cse0 (or .cse14 .cse16 .cse30)) (.cse4 (or .cse29 .cse2)) (.cse13 (or .cse15 .cse21)) (.cse7 (not .cse9)) (.cse23 (not .cse20)) (.cse11 (not .cse15))) (and (= v_~weak$$choice2~0_84 |v_P2Thread1of1ForFork0_#t~nondet16_1|) (or (and (= |v_P2_#t~ite17_53| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse0 (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_162)) (and (or (and .cse1 (= |v_P2_#t~ite17_53| v_~a$w_buff0~0_95) .cse2) (and (= |v_P2_#t~ite17_53| v_~a$w_buff1~0_110) .cse3)) (= v_~__unbuffered_p2_EBX~0_16 |v_P2_#t~ite17_53|) .cse4 .cse1 .cse5)) (let ((.cse6 (= |v_P2_#t~ite19_49| |v_P2Thread1of1ForFork0_#t~ite19_1|))) (or (and .cse6 (= v_~a$w_buff0~0_95 v_~a$w_buff0~0_94) (= |v_P2_#t~ite20_45| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse7) (and (or (and .cse6 .cse0 (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_95)) (and (let ((.cse8 (= |v_P2_#t~ite19_49| v_~a$w_buff0~0_95))) (or (and .cse1 .cse8 .cse2) (and .cse8 .cse3))) .cse4 .cse1 (= |v_P2_#t~ite19_49| |v_P2_#t~ite20_45|) .cse5)) (= |v_P2_#t~ite20_45| v_~a$w_buff0~0_94) .cse9))) (let ((.cse10 (= |v_P2_#t~ite28_51| |v_P2Thread1of1ForFork0_#t~ite28_1|))) (or (and (= v_~a$w_buff1_used~0_318 v_~a$w_buff1_used~0_317) .cse10 .cse7 (= |v_P2_#t~ite29_45| |v_P2Thread1of1ForFork0_#t~ite29_1|)) (and (or (and .cse4 (= |v_P2_#t~ite29_45| |v_P2_#t~ite28_51|) .cse11 .cse5 (let ((.cse12 (= |v_P2_#t~ite28_51| 0))) (or (and .cse12 .cse13) (and .cse12 .cse11 .cse2)))) (and (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_318) .cse10 (or .cse14 .cse15 .cse16))) (= |v_P2_#t~ite29_45| v_~a$w_buff1_used~0_317) .cse9))) (= v_~weak$$choice0~0_17 |v_P2Thread1of1ForFork0_#t~nondet15_1|) (let ((.cse17 (= |v_P2_#t~ite25_55| |v_P2Thread1of1ForFork0_#t~ite25_1|))) (or (and .cse7 (= v_~a$w_buff0_used~0_434 v_~a$w_buff0_used~0_433) .cse17 (= |v_P2_#t~ite26_51| |v_P2Thread1of1ForFork0_#t~ite26_1|)) (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_433) (or (and (= |v_P2_#t~ite26_51| v_~a$w_buff0_used~0_434) .cse0 .cse17) (and (or (and .cse1 (= |v_P2_#t~ite25_55| 0) .cse2) (and (= |v_P2_#t~ite25_55| v_~a$w_buff0_used~0_434) .cse3)) .cse4 .cse1 (= |v_P2_#t~ite25_55| |v_P2_#t~ite26_51|) .cse5)) .cse9))) (or (and (= v_~__unbuffered_p2_EBX~0_16 v_~a~0_160) .cse9) (and (= v_~a~0_160 v_~a$mem_tmp~0_26) .cse7)) (= v_~a$flush_delayed~0_38 0) (let ((.cse18 (= |v_P2_#t~ite22_49| |v_P2Thread1of1ForFork0_#t~ite22_1|))) (or (and (= v_~a$w_buff1~0_109 v_~a$w_buff1~0_110) .cse18 (= |v_P2_#t~ite23_43| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse7) (and (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_109) (or (and .cse4 .cse1 (let ((.cse19 (= |v_P2_#t~ite22_49| v_~a$w_buff1~0_110))) (or (and .cse1 .cse19 .cse2) (and .cse19 .cse3))) .cse5 (= |v_P2_#t~ite22_49| |v_P2_#t~ite23_43|)) (and .cse18 (= |v_P2_#t~ite23_43| v_~a$w_buff1~0_110) .cse0)) .cse9))) (let ((.cse22 (= |v_P2_#t~ite31_73| |v_P2Thread1of1ForFork0_#t~ite31_1|))) (or (and (or (and (or .cse15 .cse16 (and .cse20 .cse21)) (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite32_65|) .cse22) (and (= |v_P2_#t~ite31_73| |v_P2_#t~ite32_65|) .cse4 (or (and (= |v_P2_#t~ite31_73| 0) .cse11 .cse2) (and .cse13 (= v_~a$r_buff0_thd3~0_246 |v_P2_#t~ite31_73|))) .cse11 (or .cse23 .cse2))) (= v_~a$r_buff0_thd3~0_245 |v_P2_#t~ite32_65|) .cse9) (and .cse22 (= |v_P2_#t~ite32_65| |v_P2Thread1of1ForFork0_#t~ite32_1|) .cse7 (= v_~a$r_buff0_thd3~0_246 v_~a$r_buff0_thd3~0_245)))) (= v_~a~0_162 v_~a$mem_tmp~0_26) (let ((.cse24 (= |v_P2_#t~ite34_61| |v_P2Thread1of1ForFork0_#t~ite34_1|))) (or (and (= v_~a$r_buff1_thd3~0_168 v_~a$r_buff1_thd3~0_169) .cse24 .cse7 (= |v_P2_#t~ite35_53| |v_P2Thread1of1ForFork0_#t~ite35_1|)) (and (= v_~a$r_buff1_thd3~0_168 |v_P2_#t~ite35_53|) (let ((.cse25 (= (mod v_~a$r_buff0_thd3~0_245 256) 0))) (or (and .cse24 (= v_~a$r_buff1_thd3~0_169 |v_P2_#t~ite35_53|) (or .cse15 (and .cse25 .cse20) (and .cse25 .cse26))) (let ((.cse27 (not .cse25))) (and (or .cse27 .cse23) (let ((.cse28 (= |v_P2_#t~ite34_61| 0))) (or (and .cse27 .cse28 .cse11) (and (or .cse25 .cse15) .cse28))) (= |v_P2_#t~ite34_61| |v_P2_#t~ite35_53|) (or .cse29 .cse27) .cse11)))) .cse9))))))) InVars {~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_169, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_434, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_246, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_1|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, P2Thread1of1ForFork0_#t~nondet16=|v_P2Thread1of1ForFork0_#t~nondet16_1|, P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_1|, ~a~0=v_~a~0_162, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_1|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_1|, ~a$w_buff0~0=v_~a$w_buff0~0_95, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_1|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_318, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_168, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_433, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_245, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_1|, P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_1|, ~a~0=v_~a~0_160, ~a$mem_tmp~0=v_~a$mem_tmp~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_17, P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_1|, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_1|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_109, ~a$flush_delayed~0=v_~a$flush_delayed~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_94, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_317, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[|v_P2_#t~ite25_55|, |v_P2_#t~ite28_51|, |v_P2_#t~ite23_43|, |v_P2_#t~ite29_45|, |v_P2_#t~ite26_51|, |v_P2_#t~ite35_53|, |v_P2_#t~ite31_73|, |v_P2_#t~ite17_53|, |v_P2_#t~ite34_61|, |v_P2_#t~ite32_65|, |v_P2_#t~ite20_45|, |v_P2_#t~ite22_49|, |v_P2_#t~ite19_49|] AssignedVars[P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite25, ~a~0, ~a$mem_tmp~0, P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite21, ~a$w_buff1~0, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, P2Thread1of1ForFork0_#t~ite29, ~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet15, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~nondet16, P2Thread1of1ForFork0_#t~ite37, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite36, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite33, ~a$flush_delayed~0, ~a$w_buff0~0, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~ite19][222], [P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 161#true, Black: 163#(= ~__unbuffered_p2_EAX~0 0), 20#L788true, 274#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#L3-1true, Black: 278#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 260#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 256#true, Black: 143#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 145#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 149#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 199#(= ~__unbuffered_p0_EAX~0 0), 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 26#L824true, 298#(and (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), 52#L778true, 197#true, Black: 288#(and (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), Black: 302#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 294#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), 334#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 304#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0)), Black: 300#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0)), Black: 296#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 287#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 236#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 233#true, P2Thread1of1ForFork0InUse, Black: 164#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 244#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-11-02 20:26:10,491 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-02 20:26:10,491 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:26:10,491 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:26:10,491 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:26:11,081 INFO L130 PetriNetUnfolder]: 4146/8883 cut-off events. [2022-11-02 20:26:11,082 INFO L131 PetriNetUnfolder]: For 23409/31244 co-relation queries the response was YES. [2022-11-02 20:26:11,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30564 conditions, 8883 events. 4146/8883 cut-off events. For 23409/31244 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 83931 event pairs, 183 based on Foata normal form. 254/8912 useless extension candidates. Maximal degree in co-relation 30532. Up to 1218 conditions per place. [2022-11-02 20:26:11,166 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 114 selfloop transitions, 34 changer transitions 75/331 dead transitions. [2022-11-02 20:26:11,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 331 transitions, 2621 flow [2022-11-02 20:26:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:26:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:26:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1660 transitions. [2022-11-02 20:26:11,179 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8574380165289256 [2022-11-02 20:26:11,179 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1660 transitions. [2022-11-02 20:26:11,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1660 transitions. [2022-11-02 20:26:11,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:26:11,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1660 transitions. [2022-11-02 20:26:11,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 103.75) internal successors, (1660), 16 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:11,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:11,200 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:11,200 INFO L175 Difference]: Start difference. First operand has 166 places, 183 transitions, 1092 flow. Second operand 16 states and 1660 transitions. [2022-11-02 20:26:11,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 331 transitions, 2621 flow [2022-11-02 20:26:11,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 331 transitions, 2583 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-11-02 20:26:11,570 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 1084 flow [2022-11-02 20:26:11,571 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1084, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2022-11-02 20:26:11,573 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 52 predicate places. [2022-11-02 20:26:11,574 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 1084 flow [2022-11-02 20:26:11,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:11,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:26:11,575 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 20:26:11,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:26:11,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:26:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 719815893, now seen corresponding path program 1 times [2022-11-02 20:26:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:11,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072263435] [2022-11-02 20:26:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:12,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072263435] [2022-11-02 20:26:12,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072263435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:12,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:12,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:26:12,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926848825] [2022-11-02 20:26:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:12,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:26:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:12,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:26:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:26:12,439 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2022-11-02 20:26:12,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 1084 flow. Second operand has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:12,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:26:12,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2022-11-02 20:26:12,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:26:13,771 INFO L130 PetriNetUnfolder]: 1171/5029 cut-off events. [2022-11-02 20:26:13,771 INFO L131 PetriNetUnfolder]: For 11602/11860 co-relation queries the response was YES. [2022-11-02 20:26:13,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15977 conditions, 5029 events. 1171/5029 cut-off events. For 11602/11860 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 62680 event pairs, 30 based on Foata normal form. 4/4725 useless extension candidates. Maximal degree in co-relation 15872. Up to 523 conditions per place. [2022-11-02 20:26:13,822 INFO L137 encePairwiseOnDemand]: 104/121 looper letters, 51 selfloop transitions, 38 changer transitions 77/273 dead transitions. [2022-11-02 20:26:13,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 273 transitions, 2326 flow [2022-11-02 20:26:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:26:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:26:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1324 transitions. [2022-11-02 20:26:13,830 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.781582054309327 [2022-11-02 20:26:13,830 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1324 transitions. [2022-11-02 20:26:13,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1324 transitions. [2022-11-02 20:26:13,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:26:13,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1324 transitions. [2022-11-02 20:26:13,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.57142857142857) internal successors, (1324), 14 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:13,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:13,847 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:13,847 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 1084 flow. Second operand 14 states and 1324 transitions. [2022-11-02 20:26:13,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 273 transitions, 2326 flow [2022-11-02 20:26:14,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 273 transitions, 2101 flow, removed 73 selfloop flow, removed 15 redundant places. [2022-11-02 20:26:14,323 INFO L231 Difference]: Finished difference. Result has 184 places, 181 transitions, 1240 flow [2022-11-02 20:26:14,323 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1240, PETRI_PLACES=184, PETRI_TRANSITIONS=181} [2022-11-02 20:26:14,324 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 58 predicate places. [2022-11-02 20:26:14,325 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 181 transitions, 1240 flow [2022-11-02 20:26:14,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:26:14,326 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 20:26:14,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:26:14,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:26:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:14,327 INFO L85 PathProgramCache]: Analyzing trace with hash -561683319, now seen corresponding path program 2 times [2022-11-02 20:26:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:14,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178851322] [2022-11-02 20:26:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:14,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:15,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:15,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178851322] [2022-11-02 20:26:15,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178851322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:15,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:15,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:26:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889734858] [2022-11-02 20:26:15,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:15,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:26:15,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:15,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:26:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:26:15,647 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 121 [2022-11-02 20:26:15,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 181 transitions, 1240 flow. Second operand has 11 states, 11 states have (on average 94.18181818181819) internal successors, (1036), 11 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:26:15,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 121 [2022-11-02 20:26:15,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:26:16,457 INFO L130 PetriNetUnfolder]: 577/2684 cut-off events. [2022-11-02 20:26:16,457 INFO L131 PetriNetUnfolder]: For 4801/4844 co-relation queries the response was YES. [2022-11-02 20:26:16,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7808 conditions, 2684 events. 577/2684 cut-off events. For 4801/4844 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 29938 event pairs, 8 based on Foata normal form. 14/2596 useless extension candidates. Maximal degree in co-relation 7770. Up to 285 conditions per place. [2022-11-02 20:26:16,482 INFO L137 encePairwiseOnDemand]: 111/121 looper letters, 32 selfloop transitions, 7 changer transitions 17/197 dead transitions. [2022-11-02 20:26:16,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 197 transitions, 1432 flow [2022-11-02 20:26:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:26:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:26:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1052 transitions. [2022-11-02 20:26:16,485 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7903831705484599 [2022-11-02 20:26:16,485 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1052 transitions. [2022-11-02 20:26:16,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1052 transitions. [2022-11-02 20:26:16,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:26:16,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1052 transitions. [2022-11-02 20:26:16,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.63636363636364) internal successors, (1052), 11 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:16,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 121.0) internal successors, (1452), 12 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:16,494 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 121.0) internal successors, (1452), 12 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:16,494 INFO L175 Difference]: Start difference. First operand has 184 places, 181 transitions, 1240 flow. Second operand 11 states and 1052 transitions. [2022-11-02 20:26:16,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 197 transitions, 1432 flow [2022-11-02 20:26:16,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 197 transitions, 1390 flow, removed 21 selfloop flow, removed 9 redundant places. [2022-11-02 20:26:16,632 INFO L231 Difference]: Finished difference. Result has 181 places, 174 transitions, 1147 flow [2022-11-02 20:26:16,633 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1147, PETRI_PLACES=181, PETRI_TRANSITIONS=174} [2022-11-02 20:26:16,634 INFO L287 CegarLoopForPetriNet]: 126 programPoint places, 55 predicate places. [2022-11-02 20:26:16,634 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 174 transitions, 1147 flow [2022-11-02 20:26:16,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.18181818181819) internal successors, (1036), 11 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:16,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:26:16,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:16,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:26:16,635 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:26:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1812434743, now seen corresponding path program 3 times [2022-11-02 20:26:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795725187] [2022-11-02 20:26:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:26:16,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:26:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:26:16,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:26:16,867 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:26:16,868 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-02 20:26:16,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-02 20:26:16,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-02 20:26:16,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-02 20:26:16,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-02 20:26:16,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 20:26:16,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:26:16,872 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:16,881 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:26:16,881 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:26:17,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:26:17 BasicIcfg [2022-11-02 20:26:17,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:26:17,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:26:17,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:26:17,064 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:26:17,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:25:47" (3/4) ... [2022-11-02 20:26:17,069 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:26:17,252 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:26:17,253 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:26:17,254 INFO L158 Benchmark]: Toolchain (without parser) took 33308.20ms. Allocated memory was 109.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 67.9MB in the beginning and 638.2MB in the end (delta: -570.2MB). Peak memory consumption was 720.7MB. Max. memory is 16.1GB. [2022-11-02 20:26:17,254 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 109.1MB. Free memory was 86.2MB in the beginning and 86.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:26:17,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 878.02ms. Allocated memory is still 109.1MB. Free memory was 67.7MB in the beginning and 70.4MB in the end (delta: -2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:26:17,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.42ms. Allocated memory is still 109.1MB. Free memory was 70.4MB in the beginning and 67.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:26:17,255 INFO L158 Benchmark]: Boogie Preprocessor took 51.84ms. Allocated memory is still 109.1MB. Free memory was 67.9MB in the beginning and 65.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:26:17,256 INFO L158 Benchmark]: RCFGBuilder took 2069.15ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 65.4MB in the beginning and 66.4MB in the end (delta: -987.3kB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2022-11-02 20:26:17,256 INFO L158 Benchmark]: TraceAbstraction took 30042.22ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 66.4MB in the beginning and 677.0MB in the end (delta: -610.6MB). Peak memory consumption was 658.0MB. Max. memory is 16.1GB. [2022-11-02 20:26:17,257 INFO L158 Benchmark]: Witness Printer took 189.69ms. Allocated memory is still 1.4GB. Free memory was 677.0MB in the beginning and 638.2MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-02 20:26:17,259 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 109.1MB. Free memory was 86.2MB in the beginning and 86.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 878.02ms. Allocated memory is still 109.1MB. Free memory was 67.7MB in the beginning and 70.4MB in the end (delta: -2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.42ms. Allocated memory is still 109.1MB. Free memory was 70.4MB in the beginning and 67.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.84ms. Allocated memory is still 109.1MB. Free memory was 67.9MB in the beginning and 65.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2069.15ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 65.4MB in the beginning and 66.4MB in the end (delta: -987.3kB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30042.22ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 66.4MB in the beginning and 677.0MB in the end (delta: -610.6MB). Peak memory consumption was 658.0MB. Max. memory is 16.1GB. * Witness Printer took 189.69ms. Allocated memory is still 1.4GB. Free memory was 677.0MB in the beginning and 638.2MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L721] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L722] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L723] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L724] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L725] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L726] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L727] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L729] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L730] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L731] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L732] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L733] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L734] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L735] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L736] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L737] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L739] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L848] 0 pthread_t t633; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633, ((void *)0), P0, ((void *)0))=-2, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t634, ((void *)0), P1, ((void *)0))=-1, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t635; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t635, ((void *)0), P2, ((void *)0))=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] - 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: 853]: 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: 849]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 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: 29.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 758 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 758 mSDsluCounter, 851 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1333 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 191 mSDtfsCounter, 1694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1240occurred in iteration=9, InterpolantAutomatonStates: 114, 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, 6.1s InterpolantComputationTime, 920 NumberOfCodeBlocks, 920 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 4379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:26:17,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a51dc7-c747-4a63-851b-dd438efd456f/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