./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- 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-38b53e6 [2022-11-25 17:09:45,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:09:45,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:09:45,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:09:45,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:09:45,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:09:45,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:09:45,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:09:45,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:09:45,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:09:45,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:09:45,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:09:45,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:09:45,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:09:45,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:09:45,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:09:45,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:09:45,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:09:45,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:09:45,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:09:45,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:09:45,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:09:45,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:09:45,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:09:45,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:09:45,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:09:45,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:09:45,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:09:45,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:09:45,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:09:45,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:09:45,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:09:45,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:09:45,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:09:45,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:09:45,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:09:45,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:09:45,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:09:45,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:09:45,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:09:45,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:09:45,734 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:09:45,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:09:45,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:09:45,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:09:45,795 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:09:45,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:09:45,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:09:45,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:09:45,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:09:45,799 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:09:45,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:09:45,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:09:45,801 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:09:45,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:09:45,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:09:45,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:09:45,802 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:09:45,802 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:09:45,802 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:09:45,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:09:45,803 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:09:45,803 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:09:45,803 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:09:45,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:09:45,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:09:45,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:09:45,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:09:45,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:09:45,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:09:45,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:09:45,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:09:45,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:09:45,806 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:09:45,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:09:45,807 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/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_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2022-11-25 17:09:46,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:09:46,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:09:46,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:09:46,268 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:09:46,269 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:09:46,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-11-25 17:09:50,022 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:09:50,382 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:09:50,383 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-11-25 17:09:50,399 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/data/d69913a79/31fc584b66ea4c2283ec8cc61d48968c/FLAG3096ab997 [2022-11-25 17:09:50,417 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/data/d69913a79/31fc584b66ea4c2283ec8cc61d48968c [2022-11-25 17:09:50,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:09:50,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:09:50,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:09:50,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:09:50,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:09:50,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:09:50" (1/1) ... [2022-11-25 17:09:50,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e5d652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:50, skipping insertion in model container [2022-11-25 17:09:50,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:09:50" (1/1) ... [2022-11-25 17:09:50,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:09:50,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:09:50,768 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-11-25 17:09:50,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:50,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:50,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:50,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:50,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:50,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:50,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:50,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:09:51,059 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:09:51,075 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-11-25 17:09:51,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:09:51,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:09:51,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:09:51,194 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:09:51,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51 WrapperNode [2022-11-25 17:09:51,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:09:51,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:09:51,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:09:51,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:09:51,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,267 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-11-25 17:09:51,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:09:51,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:09:51,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:09:51,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:09:51,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,304 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:09:51,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:09:51,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:09:51,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:09:51,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (1/1) ... [2022-11-25 17:09:51,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:09:51,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:51,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:09:51,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67542f47-d1e3-4836-a40c-a9c726f8923e/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:09:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:09:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:09:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:09:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:09:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:09:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:09:51,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:09:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:09:51,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:09:51,426 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:09:51,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:09:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:09:51,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:09:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:09:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:09:51,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:09:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:09:51,429 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:09:51,622 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:09:51,624 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:09:52,330 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:09:52,600 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:09:52,600 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:09:52,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:09:52 BoogieIcfgContainer [2022-11-25 17:09:52,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:09:52,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:09:52,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:09:52,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:09:52,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:09:50" (1/3) ... [2022-11-25 17:09:52,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f01082e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:09:52, skipping insertion in model container [2022-11-25 17:09:52,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:51" (2/3) ... [2022-11-25 17:09:52,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f01082e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:09:52, skipping insertion in model container [2022-11-25 17:09:52,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:09:52" (3/3) ... [2022-11-25 17:09:52,615 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-11-25 17:09:52,638 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:09:52,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 17:09:52,638 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:09:52,723 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:09:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-25 17:09:52,924 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-25 17:09:52,930 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:09:52,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 17:09:52,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-11-25 17:09:52,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-11-25 17:09:52,952 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:09:52,972 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-25 17:09:52,976 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-25 17:09:52,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-11-25 17:09:53,026 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-25 17:09:53,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:09:53,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 17:09:53,032 INFO L119 LiptonReduction]: Number of co-enabled transitions 3866 [2022-11-25 17:10:02,863 INFO L134 LiptonReduction]: Checked pairs total: 11477 [2022-11-25 17:10:02,863 INFO L136 LiptonReduction]: Total number of compositions: 143 [2022-11-25 17:10:02,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:10:02,888 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@d42765, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:10:02,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:10:02,891 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:10:02,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:10:02,892 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:02,892 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:10:02,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash 632, now seen corresponding path program 1 times [2022-11-25 17:10:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:02,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104538472] [2022-11-25 17:10:02,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:02,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:03,039 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-25 17:10:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:03,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104538472] [2022-11-25 17:10:03,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104538472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:03,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:03,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:10:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531688385] [2022-11-25 17:10:03,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:03,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:10:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:03,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:10:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:10:03,080 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 294 [2022-11-25 17:10:03,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 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-25 17:10:03,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:03,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 294 [2022-11-25 17:10:03,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:05,282 INFO L130 PetriNetUnfolder]: 6949/9662 cut-off events. [2022-11-25 17:10:05,282 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-25 17:10:05,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19276 conditions, 9662 events. 6949/9662 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 52185 event pairs, 6949 based on Foata normal form. 0/8274 useless extension candidates. Maximal degree in co-relation 19264. Up to 9399 conditions per place. [2022-11-25 17:10:05,377 INFO L137 encePairwiseOnDemand]: 285/294 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-11-25 17:10:05,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2022-11-25 17:10:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:10:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:10:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2022-11-25 17:10:05,403 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-11-25 17:10:05,404 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 308 transitions. [2022-11-25 17:10:05,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 308 transitions. [2022-11-25 17:10:05,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:05,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 308 transitions. [2022-11-25 17:10:05,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 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-25 17:10:05,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 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-25 17:10:05,431 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 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-25 17:10:05,433 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 308 transitions. [2022-11-25 17:10:05,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2022-11-25 17:10:05,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:10:05,466 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2022-11-25 17:10:05,469 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-11-25 17:10:05,473 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-11-25 17:10:05,474 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2022-11-25 17:10:05,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 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-25 17:10:05,475 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:05,475 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:10:05,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:10:05,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash 598776167, now seen corresponding path program 1 times [2022-11-25 17:10:05,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:05,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001755817] [2022-11-25 17:10:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:05,956 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-25 17:10:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:05,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001755817] [2022-11-25 17:10:05,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001755817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:05,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:05,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:10:05,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574882501] [2022-11-25 17:10:05,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:05,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:10:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:05,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:10:05,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:10:05,970 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 294 [2022-11-25 17:10:05,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-25 17:10:05,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:05,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 294 [2022-11-25 17:10:05,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:07,749 INFO L130 PetriNetUnfolder]: 5463/7966 cut-off events. [2022-11-25 17:10:07,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:10:07,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15563 conditions, 7966 events. 5463/7966 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 47859 event pairs, 1005 based on Foata normal form. 0/7381 useless extension candidates. Maximal degree in co-relation 15560. Up to 5923 conditions per place. [2022-11-25 17:10:07,821 INFO L137 encePairwiseOnDemand]: 291/294 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2022-11-25 17:10:07,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 202 flow [2022-11-25 17:10:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:10:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:10:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2022-11-25 17:10:07,825 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5113378684807256 [2022-11-25 17:10:07,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2022-11-25 17:10:07,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2022-11-25 17:10:07,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:07,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2022-11-25 17:10:07,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-25 17:10:07,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:07,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:07,836 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 451 transitions. [2022-11-25 17:10:07,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 202 flow [2022-11-25 17:10:07,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:10:07,839 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2022-11-25 17:10:07,839 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-11-25 17:10:07,841 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2022-11-25 17:10:07,845 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2022-11-25 17:10:07,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-25 17:10:07,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:07,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:07,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:10:07,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1279812686, now seen corresponding path program 1 times [2022-11-25 17:10:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:07,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481579666] [2022-11-25 17:10:07,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:07,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:08,577 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-25 17:10:08,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:08,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481579666] [2022-11-25 17:10:08,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481579666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:08,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:08,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:10:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270260344] [2022-11-25 17:10:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:08,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:10:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:10:08,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:10:08,672 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2022-11-25 17:10:08,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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-25 17:10:08,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:08,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2022-11-25 17:10:08,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:12,421 INFO L130 PetriNetUnfolder]: 13785/18556 cut-off events. [2022-11-25 17:10:12,422 INFO L131 PetriNetUnfolder]: For 949/949 co-relation queries the response was YES. [2022-11-25 17:10:12,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38317 conditions, 18556 events. 13785/18556 cut-off events. For 949/949 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 93157 event pairs, 3489 based on Foata normal form. 0/18155 useless extension candidates. Maximal degree in co-relation 38313. Up to 11133 conditions per place. [2022-11-25 17:10:12,562 INFO L137 encePairwiseOnDemand]: 281/294 looper letters, 50 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2022-11-25 17:10:12,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 266 flow [2022-11-25 17:10:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:10:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:10:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2022-11-25 17:10:12,565 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47278911564625853 [2022-11-25 17:10:12,566 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2022-11-25 17:10:12,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2022-11-25 17:10:12,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:12,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2022-11-25 17:10:12,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:12,572 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:12,572 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 4 states and 556 transitions. [2022-11-25 17:10:12,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 266 flow [2022-11-25 17:10:12,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:10:12,577 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 160 flow [2022-11-25 17:10:12,577 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-11-25 17:10:12,578 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2022-11-25 17:10:12,579 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 160 flow [2022-11-25 17:10:12,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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-25 17:10:12,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:12,580 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:12,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:10:12,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1019488427, now seen corresponding path program 1 times [2022-11-25 17:10:12,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:12,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842623657] [2022-11-25 17:10:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:12,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:13,702 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-25 17:10:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:13,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842623657] [2022-11-25 17:10:13,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842623657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:13,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:13,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:10:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149188298] [2022-11-25 17:10:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:13,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:10:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:10:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:10:14,180 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 294 [2022-11-25 17:10:14,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 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-25 17:10:14,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:14,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 294 [2022-11-25 17:10:14,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:18,255 INFO L130 PetriNetUnfolder]: 11764/16443 cut-off events. [2022-11-25 17:10:18,255 INFO L131 PetriNetUnfolder]: For 8547/9099 co-relation queries the response was YES. [2022-11-25 17:10:18,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44956 conditions, 16443 events. 11764/16443 cut-off events. For 8547/9099 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 93793 event pairs, 1581 based on Foata normal form. 648/16529 useless extension candidates. Maximal degree in co-relation 44950. Up to 10781 conditions per place. [2022-11-25 17:10:18,364 INFO L137 encePairwiseOnDemand]: 287/294 looper letters, 57 selfloop transitions, 5 changer transitions 19/88 dead transitions. [2022-11-25 17:10:18,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 88 transitions, 480 flow [2022-11-25 17:10:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:10:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:10:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2022-11-25 17:10:18,368 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2022-11-25 17:10:18,368 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2022-11-25 17:10:18,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2022-11-25 17:10:18,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:18,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2022-11-25 17:10:18,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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-25 17:10:18,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:10:18,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:10:18,377 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 160 flow. Second operand 7 states and 903 transitions. [2022-11-25 17:10:18,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 88 transitions, 480 flow [2022-11-25 17:10:18,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:18,393 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 174 flow [2022-11-25 17:10:18,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2022-11-25 17:10:18,395 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2022-11-25 17:10:18,395 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 174 flow [2022-11-25 17:10:18,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 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-25 17:10:18,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:18,396 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:18,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:10:18,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:18,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1537509078, now seen corresponding path program 1 times [2022-11-25 17:10:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:18,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207125127] [2022-11-25 17:10:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:19,246 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-25 17:10:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207125127] [2022-11-25 17:10:19,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207125127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:19,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:19,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:10:19,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237874471] [2022-11-25 17:10:19,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:19,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:10:19,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:10:19,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:10:19,278 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 294 [2022-11-25 17:10:19,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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-25 17:10:19,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:19,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 294 [2022-11-25 17:10:19,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:21,698 INFO L130 PetriNetUnfolder]: 12603/17495 cut-off events. [2022-11-25 17:10:21,698 INFO L131 PetriNetUnfolder]: For 8353/8802 co-relation queries the response was YES. [2022-11-25 17:10:21,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48021 conditions, 17495 events. 12603/17495 cut-off events. For 8353/8802 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 99260 event pairs, 3943 based on Foata normal form. 189/17112 useless extension candidates. Maximal degree in co-relation 48012. Up to 14597 conditions per place. [2022-11-25 17:10:21,854 INFO L137 encePairwiseOnDemand]: 290/294 looper letters, 53 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2022-11-25 17:10:21,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 383 flow [2022-11-25 17:10:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:10:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:10:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2022-11-25 17:10:21,857 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5113378684807256 [2022-11-25 17:10:21,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2022-11-25 17:10:21,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2022-11-25 17:10:21,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:21,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2022-11-25 17:10:21,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-25 17:10:21,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:21,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:21,865 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 174 flow. Second operand 3 states and 451 transitions. [2022-11-25 17:10:21,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 383 flow [2022-11-25 17:10:22,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 363 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-25 17:10:22,013 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 194 flow [2022-11-25 17:10:22,014 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2022-11-25 17:10:22,018 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-11-25 17:10:22,019 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 194 flow [2022-11-25 17:10:22,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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-25 17:10:22,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:22,019 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:22,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:10:22,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash 418193116, now seen corresponding path program 1 times [2022-11-25 17:10:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:22,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095186409] [2022-11-25 17:10:22,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:22,873 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-25 17:10:22,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:22,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095186409] [2022-11-25 17:10:22,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095186409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:22,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:22,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935418966] [2022-11-25 17:10:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:22,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:10:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:22,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:10:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:10:22,914 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 294 [2022-11-25 17:10:22,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 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-25 17:10:22,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:22,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 294 [2022-11-25 17:10:22,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:25,706 INFO L130 PetriNetUnfolder]: 13479/18788 cut-off events. [2022-11-25 17:10:25,706 INFO L131 PetriNetUnfolder]: For 11541/12196 co-relation queries the response was YES. [2022-11-25 17:10:25,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53407 conditions, 18788 events. 13479/18788 cut-off events. For 11541/12196 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 109739 event pairs, 2863 based on Foata normal form. 331/18544 useless extension candidates. Maximal degree in co-relation 53398. Up to 14796 conditions per place. [2022-11-25 17:10:25,850 INFO L137 encePairwiseOnDemand]: 285/294 looper letters, 64 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2022-11-25 17:10:25,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 510 flow [2022-11-25 17:10:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:10:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:10:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 595 transitions. [2022-11-25 17:10:25,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2022-11-25 17:10:25,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 595 transitions. [2022-11-25 17:10:25,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 595 transitions. [2022-11-25 17:10:25,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:25,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 595 transitions. [2022-11-25 17:10:25,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 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-25 17:10:25,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:25,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:25,861 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 194 flow. Second operand 4 states and 595 transitions. [2022-11-25 17:10:25,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 510 flow [2022-11-25 17:10:25,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:25,869 INFO L231 Difference]: Finished difference. Result has 52 places, 54 transitions, 313 flow [2022-11-25 17:10:25,870 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=52, PETRI_TRANSITIONS=54} [2022-11-25 17:10:25,873 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-11-25 17:10:25,874 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 313 flow [2022-11-25 17:10:25,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 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-25 17:10:25,874 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:25,875 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:25,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:10:25,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash 415886716, now seen corresponding path program 2 times [2022-11-25 17:10:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:25,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927351809] [2022-11-25 17:10:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:26,772 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-25 17:10:26,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:26,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927351809] [2022-11-25 17:10:26,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927351809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:26,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:26,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71113099] [2022-11-25 17:10:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:26,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:10:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:26,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:10:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:10:26,813 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 294 [2022-11-25 17:10:26,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 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-25 17:10:26,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:26,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 294 [2022-11-25 17:10:26,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:30,576 INFO L130 PetriNetUnfolder]: 13935/19428 cut-off events. [2022-11-25 17:10:30,576 INFO L131 PetriNetUnfolder]: For 24521/25388 co-relation queries the response was YES. [2022-11-25 17:10:30,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63457 conditions, 19428 events. 13935/19428 cut-off events. For 24521/25388 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 113818 event pairs, 2867 based on Foata normal form. 390/19233 useless extension candidates. Maximal degree in co-relation 63447. Up to 14690 conditions per place. [2022-11-25 17:10:30,733 INFO L137 encePairwiseOnDemand]: 287/294 looper letters, 70 selfloop transitions, 18 changer transitions 0/95 dead transitions. [2022-11-25 17:10:30,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 671 flow [2022-11-25 17:10:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:10:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:10:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 595 transitions. [2022-11-25 17:10:30,736 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2022-11-25 17:10:30,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 595 transitions. [2022-11-25 17:10:30,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 595 transitions. [2022-11-25 17:10:30,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:30,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 595 transitions. [2022-11-25 17:10:30,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 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-25 17:10:30,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:30,743 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:30,743 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 313 flow. Second operand 4 states and 595 transitions. [2022-11-25 17:10:30,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 671 flow [2022-11-25 17:10:30,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 652 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:10:30,753 INFO L231 Difference]: Finished difference. Result has 54 places, 61 transitions, 410 flow [2022-11-25 17:10:30,753 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=410, PETRI_PLACES=54, PETRI_TRANSITIONS=61} [2022-11-25 17:10:30,754 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-11-25 17:10:30,755 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 61 transitions, 410 flow [2022-11-25 17:10:30,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 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-25 17:10:30,756 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:30,756 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:30,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:10:30,757 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 418141987, now seen corresponding path program 1 times [2022-11-25 17:10:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:30,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625760440] [2022-11-25 17:10:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:31,540 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-25 17:10:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:31,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625760440] [2022-11-25 17:10:31,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625760440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:31,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:10:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882917497] [2022-11-25 17:10:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:31,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:10:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:10:31,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:10:32,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 294 [2022-11-25 17:10:32,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 61 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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-25 17:10:32,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:32,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 294 [2022-11-25 17:10:32,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:34,390 INFO L130 PetriNetUnfolder]: 10174/14480 cut-off events. [2022-11-25 17:10:34,391 INFO L131 PetriNetUnfolder]: For 28165/29272 co-relation queries the response was YES. [2022-11-25 17:10:34,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52491 conditions, 14480 events. 10174/14480 cut-off events. For 28165/29272 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 83561 event pairs, 1772 based on Foata normal form. 987/15083 useless extension candidates. Maximal degree in co-relation 52480. Up to 8384 conditions per place. [2022-11-25 17:10:34,479 INFO L137 encePairwiseOnDemand]: 288/294 looper letters, 64 selfloop transitions, 4 changer transitions 34/113 dead transitions. [2022-11-25 17:10:34,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 113 transitions, 963 flow [2022-11-25 17:10:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:10:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:10:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2022-11-25 17:10:34,483 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42419825072886297 [2022-11-25 17:10:34,484 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2022-11-25 17:10:34,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2022-11-25 17:10:34,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:34,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2022-11-25 17:10:34,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 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-25 17:10:34,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:10:34,493 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:10:34,493 INFO L175 Difference]: Start difference. First operand has 54 places, 61 transitions, 410 flow. Second operand 7 states and 873 transitions. [2022-11-25 17:10:34,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 113 transitions, 963 flow [2022-11-25 17:10:34,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 113 transitions, 922 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:10:34,505 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 362 flow [2022-11-25 17:10:34,505 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2022-11-25 17:10:34,506 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2022-11-25 17:10:34,506 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 362 flow [2022-11-25 17:10:34,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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-25 17:10:34,507 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:34,507 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:34,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:10:34,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1304823423, now seen corresponding path program 1 times [2022-11-25 17:10:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:34,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941679552] [2022-11-25 17:10:34,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:34,861 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-25 17:10:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:34,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941679552] [2022-11-25 17:10:34,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941679552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:34,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634146902] [2022-11-25 17:10:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:34,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:10:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:10:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:10:34,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 294 [2022-11-25 17:10:34,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 362 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 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-25 17:10:34,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:34,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 294 [2022-11-25 17:10:34,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:36,622 INFO L130 PetriNetUnfolder]: 8157/11496 cut-off events. [2022-11-25 17:10:36,622 INFO L131 PetriNetUnfolder]: For 19557/19916 co-relation queries the response was YES. [2022-11-25 17:10:36,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40214 conditions, 11496 events. 8157/11496 cut-off events. For 19557/19916 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 64272 event pairs, 1345 based on Foata normal form. 141/11314 useless extension candidates. Maximal degree in co-relation 40203. Up to 8299 conditions per place. [2022-11-25 17:10:36,727 INFO L137 encePairwiseOnDemand]: 286/294 looper letters, 74 selfloop transitions, 16 changer transitions 0/97 dead transitions. [2022-11-25 17:10:36,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 754 flow [2022-11-25 17:10:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:10:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:10:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-11-25 17:10:36,735 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49829931972789115 [2022-11-25 17:10:36,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2022-11-25 17:10:36,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2022-11-25 17:10:36,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:36,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2022-11-25 17:10:36,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 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-25 17:10:36,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:36,742 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:36,743 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 362 flow. Second operand 4 states and 586 transitions. [2022-11-25 17:10:36,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 754 flow [2022-11-25 17:10:36,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 97 transitions, 735 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-25 17:10:36,755 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 488 flow [2022-11-25 17:10:36,756 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=488, PETRI_PLACES=54, PETRI_TRANSITIONS=66} [2022-11-25 17:10:36,759 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2022-11-25 17:10:36,759 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 488 flow [2022-11-25 17:10:36,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 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-25 17:10:36,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:36,763 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:36,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:10:36,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1396178253, now seen corresponding path program 2 times [2022-11-25 17:10:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:36,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197876915] [2022-11-25 17:10:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:37,297 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-25 17:10:37,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:37,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197876915] [2022-11-25 17:10:37,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197876915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:37,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:37,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475464399] [2022-11-25 17:10:37,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:37,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:10:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:10:37,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:10:37,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 294 [2022-11-25 17:10:37,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 66 transitions, 488 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:37,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:37,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 294 [2022-11-25 17:10:37,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:39,278 INFO L130 PetriNetUnfolder]: 8178/11526 cut-off events. [2022-11-25 17:10:39,278 INFO L131 PetriNetUnfolder]: For 29509/30138 co-relation queries the response was YES. [2022-11-25 17:10:39,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44558 conditions, 11526 events. 8178/11526 cut-off events. For 29509/30138 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 64381 event pairs, 1338 based on Foata normal form. 268/11475 useless extension candidates. Maximal degree in co-relation 44547. Up to 8311 conditions per place. [2022-11-25 17:10:39,379 INFO L137 encePairwiseOnDemand]: 287/294 looper letters, 76 selfloop transitions, 22 changer transitions 0/105 dead transitions. [2022-11-25 17:10:39,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 906 flow [2022-11-25 17:10:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:10:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:10:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2022-11-25 17:10:39,383 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2022-11-25 17:10:39,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2022-11-25 17:10:39,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2022-11-25 17:10:39,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:39,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2022-11-25 17:10:39,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 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-25 17:10:39,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:39,391 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:10:39,391 INFO L175 Difference]: Start difference. First operand has 54 places, 66 transitions, 488 flow. Second operand 4 states and 594 transitions. [2022-11-25 17:10:39,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 906 flow [2022-11-25 17:10:39,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 873 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:39,429 INFO L231 Difference]: Finished difference. Result has 57 places, 74 transitions, 606 flow [2022-11-25 17:10:39,430 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=606, PETRI_PLACES=57, PETRI_TRANSITIONS=74} [2022-11-25 17:10:39,431 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2022-11-25 17:10:39,431 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 74 transitions, 606 flow [2022-11-25 17:10:39,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:39,431 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:39,432 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:39,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:10:39,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:39,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2012512837, now seen corresponding path program 1 times [2022-11-25 17:10:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:39,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017255265] [2022-11-25 17:10:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:40,292 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-25 17:10:40,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:40,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017255265] [2022-11-25 17:10:40,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017255265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:40,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:40,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:10:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793166500] [2022-11-25 17:10:40,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:40,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:10:40,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:10:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:10:40,348 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 294 [2022-11-25 17:10:40,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 74 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 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-25 17:10:40,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:40,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 294 [2022-11-25 17:10:40,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:42,340 INFO L130 PetriNetUnfolder]: 9850/13779 cut-off events. [2022-11-25 17:10:42,340 INFO L131 PetriNetUnfolder]: For 50472/51349 co-relation queries the response was YES. [2022-11-25 17:10:42,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56457 conditions, 13779 events. 9850/13779 cut-off events. For 50472/51349 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 77138 event pairs, 1609 based on Foata normal form. 590/13871 useless extension candidates. Maximal degree in co-relation 56445. Up to 9447 conditions per place. [2022-11-25 17:10:42,441 INFO L137 encePairwiseOnDemand]: 285/294 looper letters, 93 selfloop transitions, 34 changer transitions 0/134 dead transitions. [2022-11-25 17:10:42,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 134 transitions, 1243 flow [2022-11-25 17:10:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:10:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:10:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2022-11-25 17:10:42,446 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2022-11-25 17:10:42,446 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2022-11-25 17:10:42,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2022-11-25 17:10:42,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:42,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2022-11-25 17:10:42,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 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-25 17:10:42,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 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-25 17:10:42,456 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 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-25 17:10:42,456 INFO L175 Difference]: Start difference. First operand has 57 places, 74 transitions, 606 flow. Second operand 5 states and 745 transitions. [2022-11-25 17:10:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 134 transitions, 1243 flow [2022-11-25 17:10:42,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 1212 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:42,517 INFO L231 Difference]: Finished difference. Result has 62 places, 90 transitions, 888 flow [2022-11-25 17:10:42,518 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=888, PETRI_PLACES=62, PETRI_TRANSITIONS=90} [2022-11-25 17:10:42,521 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2022-11-25 17:10:42,521 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 90 transitions, 888 flow [2022-11-25 17:10:42,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 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-25 17:10:42,522 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:42,522 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:42,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:10:42,523 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1941628515, now seen corresponding path program 1 times [2022-11-25 17:10:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:42,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315582719] [2022-11-25 17:10:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:43,500 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-25 17:10:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315582719] [2022-11-25 17:10:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315582719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:43,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:43,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:10:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97123271] [2022-11-25 17:10:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:43,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:10:43,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:10:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:10:43,590 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 294 [2022-11-25 17:10:43,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 90 transitions, 888 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 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-25 17:10:43,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:43,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 294 [2022-11-25 17:10:43,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:46,593 INFO L130 PetriNetUnfolder]: 16015/21604 cut-off events. [2022-11-25 17:10:46,593 INFO L131 PetriNetUnfolder]: For 92051/92051 co-relation queries the response was YES. [2022-11-25 17:10:46,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96792 conditions, 21604 events. 16015/21604 cut-off events. For 92051/92051 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 110679 event pairs, 4408 based on Foata normal form. 50/21654 useless extension candidates. Maximal degree in co-relation 96778. Up to 16898 conditions per place. [2022-11-25 17:10:46,725 INFO L137 encePairwiseOnDemand]: 280/294 looper letters, 107 selfloop transitions, 111 changer transitions 0/218 dead transitions. [2022-11-25 17:10:46,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 218 transitions, 2305 flow [2022-11-25 17:10:46,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:10:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:10:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2022-11-25 17:10:46,730 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4640427599611273 [2022-11-25 17:10:46,730 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2022-11-25 17:10:46,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2022-11-25 17:10:46,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:46,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2022-11-25 17:10:46,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 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-25 17:10:46,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:10:46,740 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:10:46,740 INFO L175 Difference]: Start difference. First operand has 62 places, 90 transitions, 888 flow. Second operand 7 states and 955 transitions. [2022-11-25 17:10:46,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 218 transitions, 2305 flow [2022-11-25 17:10:46,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 218 transitions, 2118 flow, removed 78 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:46,892 INFO L231 Difference]: Finished difference. Result has 72 places, 165 transitions, 2019 flow [2022-11-25 17:10:46,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2019, PETRI_PLACES=72, PETRI_TRANSITIONS=165} [2022-11-25 17:10:46,893 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2022-11-25 17:10:46,893 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 165 transitions, 2019 flow [2022-11-25 17:10:46,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 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-25 17:10:46,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:46,894 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:46,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:10:46,895 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1933619755, now seen corresponding path program 2 times [2022-11-25 17:10:46,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:46,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206129345] [2022-11-25 17:10:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:47,305 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-25 17:10:47,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:47,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206129345] [2022-11-25 17:10:47,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206129345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:47,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:47,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:10:47,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123237557] [2022-11-25 17:10:47,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:47,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:10:47,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:47,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:10:47,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:10:47,337 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 294 [2022-11-25 17:10:47,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 165 transitions, 2019 flow. Second operand has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 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-25 17:10:47,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:47,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 294 [2022-11-25 17:10:47,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:50,152 INFO L130 PetriNetUnfolder]: 12802/18097 cut-off events. [2022-11-25 17:10:50,152 INFO L131 PetriNetUnfolder]: For 143618/145535 co-relation queries the response was YES. [2022-11-25 17:10:50,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99702 conditions, 18097 events. 12802/18097 cut-off events. For 143618/145535 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 104361 event pairs, 2599 based on Foata normal form. 968/18724 useless extension candidates. Maximal degree in co-relation 99683. Up to 11606 conditions per place. [2022-11-25 17:10:50,276 INFO L137 encePairwiseOnDemand]: 285/294 looper letters, 133 selfloop transitions, 56 changer transitions 0/210 dead transitions. [2022-11-25 17:10:50,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 210 transitions, 2684 flow [2022-11-25 17:10:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:10:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:10:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2022-11-25 17:10:50,280 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48696145124716556 [2022-11-25 17:10:50,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 859 transitions. [2022-11-25 17:10:50,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 859 transitions. [2022-11-25 17:10:50,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:50,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 859 transitions. [2022-11-25 17:10:50,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.16666666666666) internal successors, (859), 6 states have internal predecessors, (859), 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-25 17:10:50,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 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-25 17:10:50,288 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 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-25 17:10:50,288 INFO L175 Difference]: Start difference. First operand has 72 places, 165 transitions, 2019 flow. Second operand 6 states and 859 transitions. [2022-11-25 17:10:50,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 210 transitions, 2684 flow [2022-11-25 17:10:50,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 210 transitions, 2513 flow, removed 85 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:50,580 INFO L231 Difference]: Finished difference. Result has 77 places, 165 transitions, 1992 flow [2022-11-25 17:10:50,581 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1992, PETRI_PLACES=77, PETRI_TRANSITIONS=165} [2022-11-25 17:10:50,582 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2022-11-25 17:10:50,582 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 165 transitions, 1992 flow [2022-11-25 17:10:50,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 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-25 17:10:50,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:50,583 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:50,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:10:50,583 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash -707196755, now seen corresponding path program 1 times [2022-11-25 17:10:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:50,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500527676] [2022-11-25 17:10:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:50,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:50,772 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-25 17:10:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:50,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500527676] [2022-11-25 17:10:50,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500527676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:50,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:50,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:50,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959640756] [2022-11-25 17:10:50,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:50,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:10:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:50,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:10:50,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:10:50,792 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 294 [2022-11-25 17:10:50,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 165 transitions, 1992 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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-25 17:10:50,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:50,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 294 [2022-11-25 17:10:50,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:52,460 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][197], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 33#L813true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 20#L839true, Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 136#L786true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,461 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,461 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,461 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,461 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,461 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][84], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 33#L813true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), 15#L763true, Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 136#L786true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,461 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,462 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,462 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,462 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,462 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][85], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 33#L813true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,462 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,462 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,462 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,462 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,467 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][250], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 20#L839true, Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 72#P2EXITtrue, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 136#L786true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,467 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,467 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,467 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,467 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,468 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][196], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), 15#L763true, Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 72#P2EXITtrue, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 136#L786true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,469 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,469 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,469 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,469 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,470 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][256], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 72#P2EXITtrue, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,470 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,470 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,470 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,470 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][250], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 20#L839true, Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 47#P1EXITtrue, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 6#L806true, 53#L756true, 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,480 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,480 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,480 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,481 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][197], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 20#L839true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 6#L806true, 53#L756true, 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,481 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,481 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,482 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,482 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x$w_buff0_used~0_125 (ite .cse0 0 v_~x$w_buff0_used~0_126)) (= v_~x$r_buff0_thd3~0_21 (ite .cse1 0 v_~x$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_74))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][294], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 33#L813true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 47#P1EXITtrue, 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,483 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,483 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,483 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,483 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,483 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x$w_buff0_used~0_125 (ite .cse0 0 v_~x$w_buff0_used~0_126)) (= v_~x$r_buff0_thd3~0_21 (ite .cse1 0 v_~x$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_74))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][115], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 33#L813true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,484 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,484 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,484 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,484 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,485 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][196], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 47#P1EXITtrue, 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), 15#L763true, Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 6#L806true, 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,485 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,485 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,485 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,485 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:52,486 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][84], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), 15#L763true, Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 6#L806true, 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:52,486 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,486 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,486 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:52,487 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:53,532 INFO L130 PetriNetUnfolder]: 10233/14325 cut-off events. [2022-11-25 17:10:53,532 INFO L131 PetriNetUnfolder]: For 167801/174918 co-relation queries the response was YES. [2022-11-25 17:10:53,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82378 conditions, 14325 events. 10233/14325 cut-off events. For 167801/174918 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 82462 event pairs, 1361 based on Foata normal form. 3309/16906 useless extension candidates. Maximal degree in co-relation 82358. Up to 8596 conditions per place. [2022-11-25 17:10:53,650 INFO L137 encePairwiseOnDemand]: 287/294 looper letters, 339 selfloop transitions, 10 changer transitions 6/384 dead transitions. [2022-11-25 17:10:53,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 384 transitions, 5514 flow [2022-11-25 17:10:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:10:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:10:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2022-11-25 17:10:53,654 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4884353741496599 [2022-11-25 17:10:53,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2022-11-25 17:10:53,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2022-11-25 17:10:53,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:53,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2022-11-25 17:10:53,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 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-25 17:10:53,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 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-25 17:10:53,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 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-25 17:10:53,663 INFO L175 Difference]: Start difference. First operand has 77 places, 165 transitions, 1992 flow. Second operand 5 states and 718 transitions. [2022-11-25 17:10:53,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 384 transitions, 5514 flow [2022-11-25 17:10:53,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 384 transitions, 5230 flow, removed 93 selfloop flow, removed 3 redundant places. [2022-11-25 17:10:53,941 INFO L231 Difference]: Finished difference. Result has 81 places, 166 transitions, 1932 flow [2022-11-25 17:10:53,941 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1932, PETRI_PLACES=81, PETRI_TRANSITIONS=166} [2022-11-25 17:10:53,942 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2022-11-25 17:10:53,943 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 166 transitions, 1932 flow [2022-11-25 17:10:53,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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-25 17:10:53,943 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:53,944 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:53,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:10:53,944 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:53,945 INFO L85 PathProgramCache]: Analyzing trace with hash 314008695, now seen corresponding path program 1 times [2022-11-25 17:10:53,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:53,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794653992] [2022-11-25 17:10:53,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:54,235 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-25 17:10:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:54,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794653992] [2022-11-25 17:10:54,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794653992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:54,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:54,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:10:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396077233] [2022-11-25 17:10:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:54,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:10:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:54,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:10:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:10:54,261 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 294 [2022-11-25 17:10:54,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 166 transitions, 1932 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 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-25 17:10:54,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:54,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 294 [2022-11-25 17:10:54,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:56,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][198], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 33#L813true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 20#L839true, Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, Black: 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 136#L786true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,612 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,613 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,613 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,613 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,613 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][85], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 33#L813true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, Black: 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,614 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,614 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,614 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,615 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,615 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][84], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 33#L813true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), 15#L763true, Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, Black: 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 136#L786true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,616 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,616 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,616 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,617 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,623 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][251], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 20#L839true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork1InUse, 72#P2EXITtrue, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 136#L786true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,623 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,623 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,624 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,624 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,625 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][257], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork1InUse, 72#P2EXITtrue, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,625 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,625 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,626 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,626 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,627 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][197], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), 15#L763true, Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 165#true, 7#L867-1true, 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 72#P2EXITtrue, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 136#L786true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,627 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,627 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,627 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,627 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,637 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][198], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 20#L839true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, Black: 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 6#L806true, 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,637 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,638 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][251], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), 20#L839true, Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 47#P1EXITtrue, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 6#L806true, 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,639 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,639 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,639 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,639 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,640 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][84], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), 15#L763true, Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, Black: 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 6#L806true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,640 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,641 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,641 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,641 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,642 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][197], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 47#P1EXITtrue, 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), 15#L763true, Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 6#L806true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,642 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,643 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,643 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,643 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x$w_buff0_used~0_125 (ite .cse0 0 v_~x$w_buff0_used~0_126)) (= v_~x$r_buff0_thd3~0_21 (ite .cse1 0 v_~x$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_74))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][115], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 33#L813true, Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, P2Thread1of1ForFork3InUse, Black: 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 38#L793true, Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,644 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,644 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,645 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,645 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:10:56,646 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x$w_buff0_used~0_125 (ite .cse0 0 v_~x$w_buff0_used~0_126)) (= v_~x$r_buff0_thd3~0_21 (ite .cse1 0 v_~x$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_74))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][299], [Black: 251#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 192#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0)), Black: 255#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 33#L813true, Black: 250#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 257#(and (= ~x~0 1) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0)), 47#P1EXITtrue, 84#L832true, Black: 200#(and (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0))), Black: 275#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 208#(and (<= ~x$w_buff1~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (< 0 (+ ~x$w_buff1~0 1))), 165#true, 7#L867-1true, 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, Black: 283#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, Black: 280#(= ~__unbuffered_cnt~0 0), 281#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 172#true, Black: 228#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x~0 1)), 53#L756true, Black: 234#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff1_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 219#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 241#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), Black: 243#(and (= 0 ~x$w_buff1~0) (or (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= ~x~0 1)), 249#(= 0 ~x$r_buff0_thd0~0)]) [2022-11-25 17:10:56,646 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,646 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,647 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:56,647 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:10:57,506 INFO L130 PetriNetUnfolder]: 7987/11329 cut-off events. [2022-11-25 17:10:57,506 INFO L131 PetriNetUnfolder]: For 130010/136639 co-relation queries the response was YES. [2022-11-25 17:10:57,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66357 conditions, 11329 events. 7987/11329 cut-off events. For 130010/136639 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 65060 event pairs, 574 based on Foata normal form. 2771/13505 useless extension candidates. Maximal degree in co-relation 66334. Up to 6451 conditions per place. [2022-11-25 17:10:57,587 INFO L137 encePairwiseOnDemand]: 287/294 looper letters, 388 selfloop transitions, 19 changer transitions 16/451 dead transitions. [2022-11-25 17:10:57,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 451 transitions, 6209 flow [2022-11-25 17:10:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:10:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:10:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1007 transitions. [2022-11-25 17:10:57,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48931000971817296 [2022-11-25 17:10:57,591 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1007 transitions. [2022-11-25 17:10:57,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1007 transitions. [2022-11-25 17:10:57,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:57,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1007 transitions. [2022-11-25 17:10:57,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.85714285714286) internal successors, (1007), 7 states have internal predecessors, (1007), 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-25 17:10:57,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:10:57,601 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:10:57,601 INFO L175 Difference]: Start difference. First operand has 81 places, 166 transitions, 1932 flow. Second operand 7 states and 1007 transitions. [2022-11-25 17:10:57,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 451 transitions, 6209 flow [2022-11-25 17:10:57,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 451 transitions, 6120 flow, removed 42 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:57,756 INFO L231 Difference]: Finished difference. Result has 89 places, 153 transitions, 1800 flow [2022-11-25 17:10:57,756 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1800, PETRI_PLACES=89, PETRI_TRANSITIONS=153} [2022-11-25 17:10:57,756 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2022-11-25 17:10:57,757 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 153 transitions, 1800 flow [2022-11-25 17:10:57,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 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-25 17:10:57,757 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:57,757 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:57,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:10:57,758 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:10:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1990212423, now seen corresponding path program 1 times [2022-11-25 17:10:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:57,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45038959] [2022-11-25 17:10:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:58,225 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-25 17:10:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:58,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45038959] [2022-11-25 17:10:58,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45038959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:58,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:58,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:10:58,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799346859] [2022-11-25 17:10:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:58,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:10:58,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:58,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:10:58,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:10:58,313 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 294 [2022-11-25 17:10:58,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 153 transitions, 1800 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 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-25 17:10:58,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:58,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 294 [2022-11-25 17:10:58,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:11:02,265 INFO L130 PetriNetUnfolder]: 14205/20458 cut-off events. [2022-11-25 17:11:02,265 INFO L131 PetriNetUnfolder]: For 162975/163962 co-relation queries the response was YES. [2022-11-25 17:11:02,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123016 conditions, 20458 events. 14205/20458 cut-off events. For 162975/163962 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 123208 event pairs, 2215 based on Foata normal form. 693/21112 useless extension candidates. Maximal degree in co-relation 122990. Up to 10943 conditions per place. [2022-11-25 17:11:02,398 INFO L137 encePairwiseOnDemand]: 280/294 looper letters, 178 selfloop transitions, 94 changer transitions 118/397 dead transitions. [2022-11-25 17:11:02,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 397 transitions, 5189 flow [2022-11-25 17:11:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:11:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:11:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 831 transitions. [2022-11-25 17:11:02,403 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4710884353741497 [2022-11-25 17:11:02,403 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 831 transitions. [2022-11-25 17:11:02,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 831 transitions. [2022-11-25 17:11:02,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:11:02,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 831 transitions. [2022-11-25 17:11:02,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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-25 17:11:02,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 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-25 17:11:02,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 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-25 17:11:02,411 INFO L175 Difference]: Start difference. First operand has 89 places, 153 transitions, 1800 flow. Second operand 6 states and 831 transitions. [2022-11-25 17:11:02,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 397 transitions, 5189 flow [2022-11-25 17:11:04,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 397 transitions, 4991 flow, removed 69 selfloop flow, removed 3 redundant places. [2022-11-25 17:11:04,493 INFO L231 Difference]: Finished difference. Result has 96 places, 192 transitions, 2692 flow [2022-11-25 17:11:04,493 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2692, PETRI_PLACES=96, PETRI_TRANSITIONS=192} [2022-11-25 17:11:04,494 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2022-11-25 17:11:04,494 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 192 transitions, 2692 flow [2022-11-25 17:11:04,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 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-25 17:11:04,494 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:11:04,494 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:11:04,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:11:04,495 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:11:04,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:11:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1413009979, now seen corresponding path program 1 times [2022-11-25 17:11:04,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:11:04,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074592074] [2022-11-25 17:11:04,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:04,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:11:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,796 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-25 17:11:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:11:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074592074] [2022-11-25 17:11:04,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074592074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:11:04,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:11:04,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:11:04,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616323742] [2022-11-25 17:11:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:11:04,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:11:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:04,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:11:04,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:11:04,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 294 [2022-11-25 17:11:04,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 192 transitions, 2692 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 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-25 17:11:04,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:11:04,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 294 [2022-11-25 17:11:04,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:11:08,217 INFO L130 PetriNetUnfolder]: 7730/11204 cut-off events. [2022-11-25 17:11:08,218 INFO L131 PetriNetUnfolder]: For 144310/149035 co-relation queries the response was YES. [2022-11-25 17:11:08,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71404 conditions, 11204 events. 7730/11204 cut-off events. For 144310/149035 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 67377 event pairs, 521 based on Foata normal form. 2125/12964 useless extension candidates. Maximal degree in co-relation 71374. Up to 6527 conditions per place. [2022-11-25 17:11:08,537 INFO L137 encePairwiseOnDemand]: 287/294 looper letters, 448 selfloop transitions, 19 changer transitions 80/589 dead transitions. [2022-11-25 17:11:08,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 589 transitions, 9454 flow [2022-11-25 17:11:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:11:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:11:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2022-11-25 17:11:08,561 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4860166288737717 [2022-11-25 17:11:08,562 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2022-11-25 17:11:08,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2022-11-25 17:11:08,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:11:08,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2022-11-25 17:11:08,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.88888888888889) internal successors, (1286), 9 states have internal predecessors, (1286), 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-25 17:11:08,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 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-25 17:11:08,573 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 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-25 17:11:08,574 INFO L175 Difference]: Start difference. First operand has 96 places, 192 transitions, 2692 flow. Second operand 9 states and 1286 transitions. [2022-11-25 17:11:08,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 589 transitions, 9454 flow [2022-11-25 17:11:08,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 589 transitions, 8743 flow, removed 173 selfloop flow, removed 8 redundant places. [2022-11-25 17:11:08,930 INFO L231 Difference]: Finished difference. Result has 97 places, 183 transitions, 2377 flow [2022-11-25 17:11:08,931 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2377, PETRI_PLACES=97, PETRI_TRANSITIONS=183} [2022-11-25 17:11:08,931 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2022-11-25 17:11:08,932 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 183 transitions, 2377 flow [2022-11-25 17:11:08,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 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-25 17:11:08,932 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:11:08,933 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:11:08,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:11:08,933 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:11:08,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:11:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2072023778, now seen corresponding path program 1 times [2022-11-25 17:11:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:11:08,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187740429] [2022-11-25 17:11:08,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:08,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:11:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:09,468 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-25 17:11:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:11:09,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187740429] [2022-11-25 17:11:09,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187740429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:11:09,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:11:09,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:11:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645459041] [2022-11-25 17:11:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:11:09,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:11:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:11:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:11:09,547 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 294 [2022-11-25 17:11:09,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 183 transitions, 2377 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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-25 17:11:09,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:11:09,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 294 [2022-11-25 17:11:09,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:11:13,856 INFO L130 PetriNetUnfolder]: 13021/19080 cut-off events. [2022-11-25 17:11:13,856 INFO L131 PetriNetUnfolder]: For 124209/125073 co-relation queries the response was YES. [2022-11-25 17:11:13,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118366 conditions, 19080 events. 13021/19080 cut-off events. For 124209/125073 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 120318 event pairs, 1191 based on Foata normal form. 669/19732 useless extension candidates. Maximal degree in co-relation 118337. Up to 9364 conditions per place. [2022-11-25 17:11:13,988 INFO L137 encePairwiseOnDemand]: 280/294 looper letters, 161 selfloop transitions, 83 changer transitions 129/379 dead transitions. [2022-11-25 17:11:13,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 379 transitions, 5410 flow [2022-11-25 17:11:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:11:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:11:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2022-11-25 17:11:13,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.463718820861678 [2022-11-25 17:11:13,993 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 818 transitions. [2022-11-25 17:11:13,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 818 transitions. [2022-11-25 17:11:13,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:11:13,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 818 transitions. [2022-11-25 17:11:13,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 states have internal predecessors, (818), 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-25 17:11:14,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 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-25 17:11:14,002 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 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-25 17:11:14,003 INFO L175 Difference]: Start difference. First operand has 97 places, 183 transitions, 2377 flow. Second operand 6 states and 818 transitions. [2022-11-25 17:11:14,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 379 transitions, 5410 flow [2022-11-25 17:11:15,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 379 transitions, 5150 flow, removed 104 selfloop flow, removed 2 redundant places. [2022-11-25 17:11:15,324 INFO L231 Difference]: Finished difference. Result has 102 places, 170 transitions, 2374 flow [2022-11-25 17:11:15,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2374, PETRI_PLACES=102, PETRI_TRANSITIONS=170} [2022-11-25 17:11:15,325 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2022-11-25 17:11:15,325 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 170 transitions, 2374 flow [2022-11-25 17:11:15,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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-25 17:11:15,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:11:15,326 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:11:15,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:11:15,327 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:11:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:11:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash -303927937, now seen corresponding path program 1 times [2022-11-25 17:11:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:11:15,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931731549] [2022-11-25 17:11:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:11:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:15,835 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-25 17:11:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:11:15,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931731549] [2022-11-25 17:11:15,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931731549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:11:15,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:11:15,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:11:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677819220] [2022-11-25 17:11:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:11:15,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:11:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:11:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:11:15,924 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2022-11-25 17:11:15,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 170 transitions, 2374 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 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-25 17:11:15,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:11:15,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2022-11-25 17:11:15,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:11:21,363 INFO L130 PetriNetUnfolder]: 15460/23128 cut-off events. [2022-11-25 17:11:21,364 INFO L131 PetriNetUnfolder]: For 153986/155270 co-relation queries the response was YES. [2022-11-25 17:11:21,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141165 conditions, 23128 events. 15460/23128 cut-off events. For 153986/155270 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 155104 event pairs, 4062 based on Foata normal form. 928/24027 useless extension candidates. Maximal degree in co-relation 141133. Up to 12215 conditions per place. [2022-11-25 17:11:21,503 INFO L137 encePairwiseOnDemand]: 288/294 looper letters, 123 selfloop transitions, 20 changer transitions 95/244 dead transitions. [2022-11-25 17:11:21,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 244 transitions, 3567 flow [2022-11-25 17:11:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:11:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:11:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2022-11-25 17:11:21,506 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4685374149659864 [2022-11-25 17:11:21,506 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2022-11-25 17:11:21,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2022-11-25 17:11:21,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:11:21,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2022-11-25 17:11:21,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 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-25 17:11:21,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:11:21,509 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 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-25 17:11:21,510 INFO L175 Difference]: Start difference. First operand has 102 places, 170 transitions, 2374 flow. Second operand 4 states and 551 transitions. [2022-11-25 17:11:21,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 244 transitions, 3567 flow [2022-11-25 17:11:23,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 244 transitions, 3545 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-11-25 17:11:23,022 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 1466 flow [2022-11-25 17:11:23,022 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1466, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2022-11-25 17:11:23,023 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 52 predicate places. [2022-11-25 17:11:23,023 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 1466 flow [2022-11-25 17:11:23,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 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-25 17:11:23,023 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:11:23,023 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:11:23,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:11:23,024 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:11:23,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:11:23,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1747604216, now seen corresponding path program 1 times [2022-11-25 17:11:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:11:23,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995451262] [2022-11-25 17:11:23,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:23,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:11:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:24,963 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-25 17:11:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:11:24,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995451262] [2022-11-25 17:11:24,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995451262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:11:24,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:11:24,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:11:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260845676] [2022-11-25 17:11:24,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:11:24,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:11:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:24,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:11:24,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:11:25,134 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 294 [2022-11-25 17:11:25,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 1466 flow. Second operand has 9 states, 9 states have (on average 132.33333333333334) internal successors, (1191), 9 states have internal predecessors, (1191), 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-25 17:11:25,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:11:25,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 294 [2022-11-25 17:11:25,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:11:31,438 INFO L130 PetriNetUnfolder]: 16392/26850 cut-off events. [2022-11-25 17:11:31,438 INFO L131 PetriNetUnfolder]: For 208704/212207 co-relation queries the response was YES. [2022-11-25 17:11:31,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158720 conditions, 26850 events. 16392/26850 cut-off events. For 208704/212207 co-relation queries the response was YES. Maximal size of possible extension queue 1658. Compared 216257 event pairs, 4598 based on Foata normal form. 831/26546 useless extension candidates. Maximal degree in co-relation 158686. Up to 14354 conditions per place. [2022-11-25 17:11:31,627 INFO L137 encePairwiseOnDemand]: 286/294 looper letters, 185 selfloop transitions, 38 changer transitions 30/267 dead transitions. [2022-11-25 17:11:31,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 267 transitions, 3419 flow [2022-11-25 17:11:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:11:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:11:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1010 transitions. [2022-11-25 17:11:31,638 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49076773566569487 [2022-11-25 17:11:31,638 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1010 transitions. [2022-11-25 17:11:31,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1010 transitions. [2022-11-25 17:11:31,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:11:31,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1010 transitions. [2022-11-25 17:11:31,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.28571428571428) internal successors, (1010), 7 states have internal predecessors, (1010), 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-25 17:11:31,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:11:31,651 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 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-25 17:11:31,652 INFO L175 Difference]: Start difference. First operand has 105 places, 117 transitions, 1466 flow. Second operand 7 states and 1010 transitions. [2022-11-25 17:11:31,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 267 transitions, 3419 flow [2022-11-25 17:11:34,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 267 transitions, 3397 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-11-25 17:11:34,797 INFO L231 Difference]: Finished difference. Result has 116 places, 140 transitions, 1947 flow [2022-11-25 17:11:34,797 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1947, PETRI_PLACES=116, PETRI_TRANSITIONS=140} [2022-11-25 17:11:34,798 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 63 predicate places. [2022-11-25 17:11:34,798 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 140 transitions, 1947 flow [2022-11-25 17:11:34,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 132.33333333333334) internal successors, (1191), 9 states have internal predecessors, (1191), 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-25 17:11:34,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:11:34,799 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:11:34,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:11:34,799 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:11:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:11:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash 958046632, now seen corresponding path program 2 times [2022-11-25 17:11:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:11:34,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590539097] [2022-11-25 17:11:34,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:34,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:11:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:35,122 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-25 17:11:35,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:11:35,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590539097] [2022-11-25 17:11:35,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590539097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:11:35,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:11:35,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:11:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618745216] [2022-11-25 17:11:35,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:11:35,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:11:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:11:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:11:35,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 294 [2022-11-25 17:11:35,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 140 transitions, 1947 flow. Second operand has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 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-25 17:11:35,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:11:35,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 294 [2022-11-25 17:11:35,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand