./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.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_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/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_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/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_c81a5396-a283-4950-b4b1-099e1483a71c/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 b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --- 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:22:42,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:22:42,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:22:42,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:22:42,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:22:42,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:22:42,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:22:42,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:22:42,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:22:42,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:22:42,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:22:42,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:22:42,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:22:42,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:22:42,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:22:42,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:22:42,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:22:42,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:22:42,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:22:42,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:22:42,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:22:42,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:22:42,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:22:42,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:22:42,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:22:42,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:22:42,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:22:42,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:22:42,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:22:42,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:22:42,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:22:42,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:22:42,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:22:42,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:22:42,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:22:42,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:22:42,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:22:42,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:22:42,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:22:42,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:22:42,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:22:42,818 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:22:42,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:22:42,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:22:42,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:22:42,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:22:42,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:22:42,862 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:22:42,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:22:42,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:22:42,863 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:22:42,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:22:42,864 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:22:42,865 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:22:42,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:22:42,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:22:42,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:22:42,865 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:22:42,866 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:22:42,866 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:22:42,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:22:42,866 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:22:42,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:22:42,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:22:42,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:22:42,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:22:42,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:22:42,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:22:42,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:22:42,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:22:42,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:22:42,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:22:42,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:22:42,870 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:22:42,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:22:42,870 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_c81a5396-a283-4950-b4b1-099e1483a71c/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_c81a5396-a283-4950-b4b1-099e1483a71c/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 -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 [2022-11-25 17:22:43,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:22:43,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:22:43,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:22:43,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:22:43,184 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:22:43,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:22:46,308 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:22:46,669 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:22:46,671 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:22:46,692 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/data/108fc4b77/d00ea666314a41b29a4c470e33e0a068/FLAG28048bd6c [2022-11-25 17:22:46,706 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/data/108fc4b77/d00ea666314a41b29a4c470e33e0a068 [2022-11-25 17:22:46,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:22:46,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:22:46,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:22:46,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:22:46,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:22:46,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:22:46" (1/1) ... [2022-11-25 17:22:46,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2e47b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:46, skipping insertion in model container [2022-11-25 17:22:46,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:22:46" (1/1) ... [2022-11-25 17:22:46,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:22:46,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:22:46,982 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_c81a5396-a283-4950-b4b1-099e1483a71c/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:22:47,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:22:47,358 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:22:47,370 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_c81a5396-a283-4950-b4b1-099e1483a71c/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:22:47,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:22:47,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:22:47,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:22:47,464 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:22:47,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47 WrapperNode [2022-11-25 17:22:47,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:22:47,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:22:47,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:22:47,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:22:47,475 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:22:47" (1/1) ... [2022-11-25 17:22:47,507 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:22:47" (1/1) ... [2022-11-25 17:22:47,545 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-25 17:22:47,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:22:47,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:22:47,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:22:47,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:22:47,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,575 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:22:47,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:22:47,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:22:47,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:22:47,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (1/1) ... [2022-11-25 17:22:47,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:22:47,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:22:47,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:22:47,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:22:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:22:47,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:22:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:22:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:22:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:22:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:22:47,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:22:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:22:47,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:22:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:22:47,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:22:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:22:47,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:22:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:22:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:22:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:22:47,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:22:47,716 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:22:47,947 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:22:47,951 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:22:48,444 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:22:48,708 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:22:48,708 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:22:48,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:22:48 BoogieIcfgContainer [2022-11-25 17:22:48,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:22:48,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:22:48,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:22:48,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:22:48,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:22:46" (1/3) ... [2022-11-25 17:22:48,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545e6935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:22:48, skipping insertion in model container [2022-11-25 17:22:48,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:22:47" (2/3) ... [2022-11-25 17:22:48,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545e6935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:22:48, skipping insertion in model container [2022-11-25 17:22:48,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:22:48" (3/3) ... [2022-11-25 17:22:48,732 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:22:48,753 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:22:48,754 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 17:22:48,754 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:22:48,842 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:22:48,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-25 17:22:49,010 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-25 17:22:49,011 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:22:49,024 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 103 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:22:49,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-11-25 17:22:49,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-11-25 17:22:49,042 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:22:49,071 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-25 17:22:49,074 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-25 17:22:49,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-11-25 17:22:49,154 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-25 17:22:49,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:22:49,156 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 104 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:22:49,161 INFO L119 LiptonReduction]: Number of co-enabled transitions 3922 [2022-11-25 17:22:55,945 INFO L134 LiptonReduction]: Checked pairs total: 11423 [2022-11-25 17:22:55,946 INFO L136 LiptonReduction]: Total number of compositions: 144 [2022-11-25 17:22:55,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:22:55,971 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;@4fa58287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:22:55,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:22:55,973 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:22:55,973 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:22:55,973 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:22:55,974 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:22:55,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:22:55,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:22:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash 632, now seen corresponding path program 1 times [2022-11-25 17:22:55,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:22:55,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098505984] [2022-11-25 17:22:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:22:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:22:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:56,129 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:22:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:22:56,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098505984] [2022-11-25 17:22:56,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098505984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:22:56,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:22:56,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:22:56,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466450875] [2022-11-25 17:22:56,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:22:56,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:22:56,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:22:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:22:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:22:56,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 295 [2022-11-25 17:22:56,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 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:22:56,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:22:56,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 295 [2022-11-25 17:22:56,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:22:58,400 INFO L130 PetriNetUnfolder]: 8719/11815 cut-off events. [2022-11-25 17:22:58,400 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-11-25 17:22:58,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23763 conditions, 11815 events. 8719/11815 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 63465 event pairs, 8719 based on Foata normal form. 0/10307 useless extension candidates. Maximal degree in co-relation 23751. Up to 11731 conditions per place. [2022-11-25 17:22:58,498 INFO L137 encePairwiseOnDemand]: 286/295 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2022-11-25 17:22:58,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2022-11-25 17:22:58,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:22:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:22:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2022-11-25 17:22:58,521 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.523728813559322 [2022-11-25 17:22:58,522 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2022-11-25 17:22:58,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2022-11-25 17:22:58,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:22:58,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2022-11-25 17:22:58,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:22:58,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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:22:58,543 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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:22:58,545 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 309 transitions. [2022-11-25 17:22:58,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2022-11-25 17:22:58,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:22:58,597 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2022-11-25 17:22:58,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-11-25 17:22:58,603 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-11-25 17:22:58,603 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2022-11-25 17:22:58,604 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:22:58,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:22:58,604 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:22:58,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:22:58,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:22:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:22:58,605 INFO L85 PathProgramCache]: Analyzing trace with hash 622999, now seen corresponding path program 1 times [2022-11-25 17:22:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:22:58,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590525495] [2022-11-25 17:22:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:22:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:22:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:22:58,954 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:22:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:22:58,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590525495] [2022-11-25 17:22:58,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590525495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:22:58,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:22:58,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:22:58,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128285815] [2022-11-25 17:22:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:22:58,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:22:58,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:22:58,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:22:58,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:22:58,967 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 295 [2022-11-25 17:22:58,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:22:58,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:22:58,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 295 [2022-11-25 17:22:58,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:00,618 INFO L130 PetriNetUnfolder]: 6855/9883 cut-off events. [2022-11-25 17:23:00,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:00,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19320 conditions, 9883 events. 6855/9883 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 61855 event pairs, 1263 based on Foata normal form. 0/9221 useless extension candidates. Maximal degree in co-relation 19317. Up to 7399 conditions per place. [2022-11-25 17:23:00,690 INFO L137 encePairwiseOnDemand]: 292/295 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2022-11-25 17:23:00,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2022-11-25 17:23:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:23:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:23:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-11-25 17:23:00,694 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5141242937853108 [2022-11-25 17:23:00,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2022-11-25 17:23:00,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2022-11-25 17:23:00,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:00,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2022-11-25 17:23:00,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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:23:00,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:23:00,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:23:00,702 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 455 transitions. [2022-11-25 17:23:00,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2022-11-25 17:23:00,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:23:00,762 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2022-11-25 17:23:00,762 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-11-25 17:23:00,763 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-11-25 17:23:00,763 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2022-11-25 17:23:00,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:23:00,764 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:00,764 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:00,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:23:00,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1719939885, now seen corresponding path program 1 times [2022-11-25 17:23:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:00,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965220169] [2022-11-25 17:23:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:01,104 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:23:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:01,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965220169] [2022-11-25 17:23:01,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965220169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:01,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:01,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:23:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451926899] [2022-11-25 17:23:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:01,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:23:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:01,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:23:01,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:23:01,141 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 295 [2022-11-25 17:23:01,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:01,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:01,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 295 [2022-11-25 17:23:01,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:06,292 INFO L130 PetriNetUnfolder]: 31461/42137 cut-off events. [2022-11-25 17:23:06,292 INFO L131 PetriNetUnfolder]: For 1948/1948 co-relation queries the response was YES. [2022-11-25 17:23:06,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86840 conditions, 42137 events. 31461/42137 cut-off events. For 1948/1948 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 231937 event pairs, 11107 based on Foata normal form. 0/41262 useless extension candidates. Maximal degree in co-relation 86836. Up to 24333 conditions per place. [2022-11-25 17:23:06,574 INFO L137 encePairwiseOnDemand]: 284/295 looper letters, 47 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2022-11-25 17:23:06,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 246 flow [2022-11-25 17:23:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:23:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:23:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-11-25 17:23:06,578 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4824858757062147 [2022-11-25 17:23:06,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2022-11-25 17:23:06,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2022-11-25 17:23:06,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:06,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2022-11-25 17:23:06,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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:23:06,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:23:06,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:23:06,584 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 427 transitions. [2022-11-25 17:23:06,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 246 flow [2022-11-25 17:23:06,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:23:06,589 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2022-11-25 17:23:06,589 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-11-25 17:23:06,591 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2022-11-25 17:23:06,591 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2022-11-25 17:23:06,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:06,592 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:06,592 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:06,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:23:06,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1778530994, now seen corresponding path program 1 times [2022-11-25 17:23:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:06,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972415181] [2022-11-25 17:23:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:06,920 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:23:06,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:06,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972415181] [2022-11-25 17:23:06,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972415181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:06,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:06,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:23:06,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669391738] [2022-11-25 17:23:06,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:06,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:06,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:06,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:06,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 295 [2022-11-25 17:23:06,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:06,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:06,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 295 [2022-11-25 17:23:06,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:11,203 INFO L130 PetriNetUnfolder]: 29980/40150 cut-off events. [2022-11-25 17:23:11,203 INFO L131 PetriNetUnfolder]: For 19331/19331 co-relation queries the response was YES. [2022-11-25 17:23:11,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103909 conditions, 40150 events. 29980/40150 cut-off events. For 19331/19331 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 221371 event pairs, 5940 based on Foata normal form. 275/40425 useless extension candidates. Maximal degree in co-relation 103904. Up to 17101 conditions per place. [2022-11-25 17:23:11,595 INFO L137 encePairwiseOnDemand]: 285/295 looper letters, 74 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2022-11-25 17:23:11,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 448 flow [2022-11-25 17:23:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:23:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:23:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2022-11-25 17:23:11,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4822033898305085 [2022-11-25 17:23:11,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2022-11-25 17:23:11,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2022-11-25 17:23:11,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:11,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2022-11-25 17:23:11,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states 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:23:11,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states 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:23:11,606 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states 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:23:11,606 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 569 transitions. [2022-11-25 17:23:11,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 84 transitions, 448 flow [2022-11-25 17:23:11,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:23:11,772 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 206 flow [2022-11-25 17:23:11,772 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2022-11-25 17:23:11,773 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2022-11-25 17:23:11,773 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 206 flow [2022-11-25 17:23:11,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:11,774 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:11,774 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:11,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:23:11,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1778528118, now seen corresponding path program 1 times [2022-11-25 17:23:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561866668] [2022-11-25 17:23:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:12,635 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:23:12,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:12,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561866668] [2022-11-25 17:23:12,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561866668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:12,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:12,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:23:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676815048] [2022-11-25 17:23:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:12,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:23:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:23:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:12,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 295 [2022-11-25 17:23:12,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 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:23:12,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:12,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 295 [2022-11-25 17:23:12,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:14,688 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([592] L887-->L871-2: Formula: (and (= (store |v_#valid_215| |v_ULTIMATE.start_main_~#t601~0#1.base_47| 0) |v_#valid_214|) (= |v_ULTIMATE.start_main_#res#1_30| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0)) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_74) (= 2 v_~__unbuffered_p3_EAX~0_74) (= v_~__unbuffered_p1_EBX~0_76 0) (= 0 v_~__unbuffered_p3_EBX~0_82) (= v_~z~0_80 2) (= v_~x~0_78 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70)) InVars {ULTIMATE.start_main_~#t601~0#1.base=|v_ULTIMATE.start_main_~#t601~0#1.base_47|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, #valid=|v_#valid_215|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_74, ~z~0=v_~z~0_80, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_82, ~x~0=v_~x~0_78} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_82, ULTIMATE.start_main_~#t601~0#1.offset=|v_ULTIMATE.start_main_~#t601~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, #valid=|v_#valid_214|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_74, ~z~0=v_~z~0_80, ~x~0=v_~x~0_78} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t601~0#1.offset, ULTIMATE.start_main_~#t601~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0][57], [P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 154#L783true, 73#L773true, 192#(and (= |ULTIMATE.start_main_old_#valid#1| (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 172#true, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 180#(= ~__unbuffered_p1_EAX~0 0), 123#L871-2true, Black: 178#true, 128#L809true, 58#L829true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:14,688 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 17:23:14,688 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 17:23:14,689 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 17:23:14,689 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 17:23:14,689 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][51], [P2Thread1of1ForFork3InUse, 139#L887true, P1Thread1of1ForFork0InUse, 154#L783true, 73#L773true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 97#L845true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, 128#L809true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:14,689 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 17:23:14,689 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 17:23:14,689 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 17:23:14,690 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 17:23:14,944 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([592] L887-->L871-2: Formula: (and (= (store |v_#valid_215| |v_ULTIMATE.start_main_~#t601~0#1.base_47| 0) |v_#valid_214|) (= |v_ULTIMATE.start_main_#res#1_30| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0)) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_74) (= 2 v_~__unbuffered_p3_EAX~0_74) (= v_~__unbuffered_p1_EBX~0_76 0) (= 0 v_~__unbuffered_p3_EBX~0_82) (= v_~z~0_80 2) (= v_~x~0_78 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70)) InVars {ULTIMATE.start_main_~#t601~0#1.base=|v_ULTIMATE.start_main_~#t601~0#1.base_47|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, #valid=|v_#valid_215|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_74, ~z~0=v_~z~0_80, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_82, ~x~0=v_~x~0_78} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_82, ULTIMATE.start_main_~#t601~0#1.offset=|v_ULTIMATE.start_main_~#t601~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, #valid=|v_#valid_214|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_74, ~z~0=v_~z~0_80, ~x~0=v_~x~0_78} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t601~0#1.offset, ULTIMATE.start_main_~#t601~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0][57], [P2Thread1of1ForFork3InUse, 154#L783true, P1Thread1of1ForFork0InUse, 192#(and (= |ULTIMATE.start_main_old_#valid#1| (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 81#P0EXITtrue, Black: 172#true, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 180#(= ~__unbuffered_p1_EAX~0 0), 128#L809true, 123#L871-2true, Black: 178#true, 58#L829true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:14,945 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:14,945 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:14,945 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:14,945 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:14,946 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][51], [P2Thread1of1ForFork3InUse, 139#L887true, 154#L783true, P1Thread1of1ForFork0InUse, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 97#L845true, 81#P0EXITtrue, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 180#(= ~__unbuffered_p1_EAX~0 0), 128#L809true, Black: 178#true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:14,946 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:14,946 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:14,946 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:14,946 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:16,350 INFO L130 PetriNetUnfolder]: 18162/25625 cut-off events. [2022-11-25 17:23:16,350 INFO L131 PetriNetUnfolder]: For 15777/17687 co-relation queries the response was YES. [2022-11-25 17:23:16,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66246 conditions, 25625 events. 18162/25625 cut-off events. For 15777/17687 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 159843 event pairs, 4037 based on Foata normal form. 1815/26265 useless extension candidates. Maximal degree in co-relation 66239. Up to 16476 conditions per place. [2022-11-25 17:23:16,487 INFO L137 encePairwiseOnDemand]: 289/295 looper letters, 43 selfloop transitions, 4 changer transitions 21/81 dead transitions. [2022-11-25 17:23:16,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 444 flow [2022-11-25 17:23:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2022-11-25 17:23:16,490 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4242130750605327 [2022-11-25 17:23:16,491 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2022-11-25 17:23:16,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2022-11-25 17:23:16,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:16,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2022-11-25 17:23:16,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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:23:16,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states 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:23:16,499 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states 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:23:16,499 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 206 flow. Second operand 7 states and 876 transitions. [2022-11-25 17:23:16,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 444 flow [2022-11-25 17:23:16,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:23:16,689 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 191 flow [2022-11-25 17:23:16,689 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-11-25 17:23:16,690 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2022-11-25 17:23:16,690 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 191 flow [2022-11-25 17:23:16,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 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:23:16,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:16,691 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:16,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:23:16,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1967151063, now seen corresponding path program 1 times [2022-11-25 17:23:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:16,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075567419] [2022-11-25 17:23:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:16,866 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:23:16,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:16,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075567419] [2022-11-25 17:23:16,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075567419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:16,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:16,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:23:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447275076] [2022-11-25 17:23:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:16,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:16,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:16,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:16,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 295 [2022-11-25 17:23:16,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:23:16,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:16,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 295 [2022-11-25 17:23:16,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:19,685 INFO L130 PetriNetUnfolder]: 17488/23740 cut-off events. [2022-11-25 17:23:19,685 INFO L131 PetriNetUnfolder]: For 17300/17300 co-relation queries the response was YES. [2022-11-25 17:23:19,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64104 conditions, 23740 events. 17488/23740 cut-off events. For 17300/17300 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 121240 event pairs, 4657 based on Foata normal form. 200/23940 useless extension candidates. Maximal degree in co-relation 64096. Up to 9821 conditions per place. [2022-11-25 17:23:19,797 INFO L137 encePairwiseOnDemand]: 286/295 looper letters, 63 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2022-11-25 17:23:19,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 457 flow [2022-11-25 17:23:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:23:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:23:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2022-11-25 17:23:19,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4703389830508475 [2022-11-25 17:23:19,803 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2022-11-25 17:23:19,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2022-11-25 17:23:19,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:19,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2022-11-25 17:23:19,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:23:19,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states 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:23:19,816 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states 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:23:19,817 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 191 flow. Second operand 4 states and 555 transitions. [2022-11-25 17:23:19,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 457 flow [2022-11-25 17:23:20,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 450 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:23:20,266 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 299 flow [2022-11-25 17:23:20,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2022-11-25 17:23:20,270 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2022-11-25 17:23:20,270 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 299 flow [2022-11-25 17:23:20,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:23:20,271 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:20,271 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:20,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:23:20,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash -915295115, now seen corresponding path program 1 times [2022-11-25 17:23:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:20,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001388987] [2022-11-25 17:23:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:20,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:20,482 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:23:20,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:20,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001388987] [2022-11-25 17:23:20,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001388987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:20,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:20,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725660990] [2022-11-25 17:23:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:20,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:20,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:20,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:20,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:20,500 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 17:23:20,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:23:20,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:20,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 17:23:20,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:21,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][98], [P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 194#true, 77#L2true, 73#L773true, Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 95#L789true, Black: 172#true, 115#L826true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 67#P2EXITtrue, Black: 178#true, 196#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:21,601 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:21,601 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:21,601 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:21,601 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:21,754 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][47], [139#L887true, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 194#true, 73#L773true, Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 95#L789true, Black: 172#true, 115#L826true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 67#P2EXITtrue, Black: 178#true, 196#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 202#true, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:21,754 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,754 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,754 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,754 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,760 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][110], [P2Thread1of1ForFork3InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 77#L2true, 104#L766true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 97#L845true, 95#L789true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 194#true, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 67#P2EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 178#true]) [2022-11-25 17:23:21,760 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,760 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,761 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,761 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,761 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][98], [P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 73#L773true, 77#L2true, Black: 194#true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 95#L789true, 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 67#P2EXITtrue, Black: 178#true, 58#L829true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:21,762 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,762 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,762 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,762 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:21,934 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][102], [139#L887true, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 104#L766true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 97#L845true, 95#L789true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 194#true, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 67#P2EXITtrue, P3Thread1of1ForFork1InUse, 202#true, P0Thread1of1ForFork2InUse, 178#true]) [2022-11-25 17:23:21,934 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 17:23:21,934 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:23:21,934 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:23:21,934 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:23:21,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][47], [139#L887true, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 73#L773true, Black: 194#true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 95#L789true, 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 67#P2EXITtrue, Black: 178#true, 58#L829true, P3Thread1of1ForFork1InUse, 202#true, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:21,935 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 17:23:21,935 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:23:21,935 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:23:21,935 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:23:22,503 INFO L130 PetriNetUnfolder]: 10535/15641 cut-off events. [2022-11-25 17:23:22,503 INFO L131 PetriNetUnfolder]: For 13625/14815 co-relation queries the response was YES. [2022-11-25 17:23:22,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40888 conditions, 15641 events. 10535/15641 cut-off events. For 13625/14815 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 101280 event pairs, 1802 based on Foata normal form. 1256/16209 useless extension candidates. Maximal degree in co-relation 40878. Up to 9168 conditions per place. [2022-11-25 17:23:22,596 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 84 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2022-11-25 17:23:22,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 113 transitions, 754 flow [2022-11-25 17:23:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:23:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2022-11-25 17:23:22,601 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4894915254237288 [2022-11-25 17:23:22,602 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2022-11-25 17:23:22,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2022-11-25 17:23:22,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:22,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2022-11-25 17:23:22,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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:23:22,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states 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:23:22,609 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states 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:23:22,609 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 299 flow. Second operand 5 states and 722 transitions. [2022-11-25 17:23:22,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 113 transitions, 754 flow [2022-11-25 17:23:22,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 750 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:23:22,693 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 370 flow [2022-11-25 17:23:22,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2022-11-25 17:23:22,694 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2022-11-25 17:23:22,694 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 370 flow [2022-11-25 17:23:22,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:23:22,694 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:22,695 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:22,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:23:22,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash 649455281, now seen corresponding path program 1 times [2022-11-25 17:23:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:22,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900456921] [2022-11-25 17:23:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:22,981 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:23:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:22,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900456921] [2022-11-25 17:23:22,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900456921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:22,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:22,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913186460] [2022-11-25 17:23:22,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:22,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:22,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:22,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:23,000 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 17:23:23,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 370 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:23:23,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:23,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 17:23:23,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:24,217 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [P2Thread1of1ForFork3InUse, 220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 77#L2true, Black: 194#true, 73#L773true, Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 95#L789true, Black: 172#true, 115#L826true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 67#P2EXITtrue, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:24,217 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:24,218 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:24,218 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:24,218 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:24,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [P2Thread1of1ForFork3InUse, 220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork0InUse, Black: 194#true, 77#L2true, 73#L773true, Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 95#L789true, Black: 172#true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#L826true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, P3Thread1of1ForFork1InUse, 202#true, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:24,218 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:24,218 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:24,219 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:24,219 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:24,366 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][119], [P2Thread1of1ForFork3InUse, 220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 104#L766true, 77#L2true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 97#L845true, 95#L789true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 194#true, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 67#P2EXITtrue, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), P3Thread1of1ForFork1InUse, 178#true, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:24,366 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,366 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,366 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,366 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,366 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [P2Thread1of1ForFork3InUse, 220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 73#L773true, Black: 194#true, 77#L2true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 95#L789true, 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 67#P2EXITtrue, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, 58#L829true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:24,366 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,367 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,367 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,367 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,369 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][119], [P2Thread1of1ForFork3InUse, 220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork0InUse, 104#L766true, 77#L2true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 97#L845true, 95#L789true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 194#true, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, Black: 180#(= ~__unbuffered_p1_EAX~0 0), P3Thread1of1ForFork1InUse, 202#true, P0Thread1of1ForFork2InUse, 178#true]) [2022-11-25 17:23:24,369 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,369 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,369 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,369 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,369 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [P2Thread1of1ForFork3InUse, 220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork0InUse, Black: 194#true, 77#L2true, 73#L773true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 95#L789true, 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, 58#L829true, P3Thread1of1ForFork1InUse, 202#true, P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:24,369 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,370 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,370 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,370 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:24,758 INFO L130 PetriNetUnfolder]: 8509/12989 cut-off events. [2022-11-25 17:23:24,759 INFO L131 PetriNetUnfolder]: For 15087/15890 co-relation queries the response was YES. [2022-11-25 17:23:24,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41983 conditions, 12989 events. 8509/12989 cut-off events. For 15087/15890 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 86489 event pairs, 1002 based on Foata normal form. 822/13245 useless extension candidates. Maximal degree in co-relation 41969. Up to 3794 conditions per place. [2022-11-25 17:23:24,858 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 118 selfloop transitions, 19 changer transitions 0/156 dead transitions. [2022-11-25 17:23:24,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 156 transitions, 1122 flow [2022-11-25 17:23:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1013 transitions. [2022-11-25 17:23:24,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49055690072639224 [2022-11-25 17:23:24,864 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1013 transitions. [2022-11-25 17:23:24,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1013 transitions. [2022-11-25 17:23:24,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:24,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1013 transitions. [2022-11-25 17:23:24,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.71428571428572) internal successors, (1013), 7 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states 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:23:24,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states 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:23:24,875 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states 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:23:24,876 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 370 flow. Second operand 7 states and 1013 transitions. [2022-11-25 17:23:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 156 transitions, 1122 flow [2022-11-25 17:23:25,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 156 transitions, 1117 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:23:25,017 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 499 flow [2022-11-25 17:23:25,018 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=499, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2022-11-25 17:23:25,018 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2022-11-25 17:23:25,018 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 499 flow [2022-11-25 17:23:25,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:23:25,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:25,019 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] [2022-11-25 17:23:25,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:23:25,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1934531724, now seen corresponding path program 1 times [2022-11-25 17:23:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:25,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185350786] [2022-11-25 17:23:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:25,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:23:25,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:25,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185350786] [2022-11-25 17:23:25,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185350786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:25,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:25,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:23:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105433947] [2022-11-25 17:23:25,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:25,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:23:25,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 17:23:25,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states 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:23:25,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:25,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 17:23:25,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:26,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, 220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 77#L2true, Black: 194#true, 73#L773true, Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 95#L789true, Black: 172#true, 115#L826true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 165#true, 67#P2EXITtrue, Black: 178#true, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:26,375 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:26,375 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:26,375 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:26,375 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:26,376 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, 220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork0InUse, Black: 194#true, 77#L2true, 73#L773true, Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 95#L789true, Black: 172#true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#L826true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 165#true, 67#P2EXITtrue, Black: 178#true, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse]) [2022-11-25 17:23:26,376 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:26,376 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:26,376 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:26,376 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:26,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][119], [220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 104#L766true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 95#L789true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 194#true, 165#true, 67#P2EXITtrue, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 77#L2true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 97#L845true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 178#true]) [2022-11-25 17:23:26,531 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,532 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,532 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,532 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 194#true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 95#L789true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, 58#L829true, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 77#L2true, 73#L773true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true]) [2022-11-25 17:23:26,532 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,532 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,532 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,532 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][119], [220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 104#L766true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 95#L789true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 194#true, 165#true, 67#P2EXITtrue, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 77#L2true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 97#L845true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 178#true]) [2022-11-25 17:23:26,535 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,535 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,535 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,535 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,536 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][101], [220#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 194#true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 95#L789true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, 58#L829true, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 73#L773true, 77#L2true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true]) [2022-11-25 17:23:26,536 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,536 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,536 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,536 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:26,989 INFO L130 PetriNetUnfolder]: 7987/12178 cut-off events. [2022-11-25 17:23:26,989 INFO L131 PetriNetUnfolder]: For 22395/23134 co-relation queries the response was YES. [2022-11-25 17:23:27,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44987 conditions, 12178 events. 7987/12178 cut-off events. For 22395/23134 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 80872 event pairs, 894 based on Foata normal form. 297/11922 useless extension candidates. Maximal degree in co-relation 44970. Up to 3634 conditions per place. [2022-11-25 17:23:27,091 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 131 selfloop transitions, 28 changer transitions 13/191 dead transitions. [2022-11-25 17:23:27,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 191 transitions, 1482 flow [2022-11-25 17:23:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:23:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:23:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1302 transitions. [2022-11-25 17:23:27,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4903954802259887 [2022-11-25 17:23:27,098 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1302 transitions. [2022-11-25 17:23:27,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1302 transitions. [2022-11-25 17:23:27,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:27,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1302 transitions. [2022-11-25 17:23:27,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.66666666666666) internal successors, (1302), 9 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states 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:23:27,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 295.0) internal successors, (2950), 10 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states 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:23:27,111 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 295.0) internal successors, (2950), 10 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states 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:23:27,111 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 499 flow. Second operand 9 states and 1302 transitions. [2022-11-25 17:23:27,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 191 transitions, 1482 flow [2022-11-25 17:23:28,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 191 transitions, 1432 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-11-25 17:23:28,274 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 627 flow [2022-11-25 17:23:28,275 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=627, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2022-11-25 17:23:28,275 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2022-11-25 17:23:28,276 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 627 flow [2022-11-25 17:23:28,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states 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:23:28,277 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:28,277 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:23:28,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:23:28,277 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1628721761, now seen corresponding path program 1 times [2022-11-25 17:23:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:28,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190563906] [2022-11-25 17:23:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:28,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:29,050 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:23:29,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:29,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190563906] [2022-11-25 17:23:29,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190563906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:29,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:29,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:29,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917062471] [2022-11-25 17:23:29,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:29,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:29,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:29,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:23:29,093 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 17:23:29,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 627 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:23:29,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:29,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 17:23:29,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:31,050 INFO L130 PetriNetUnfolder]: 9939/15515 cut-off events. [2022-11-25 17:23:31,050 INFO L131 PetriNetUnfolder]: For 40995/41854 co-relation queries the response was YES. [2022-11-25 17:23:31,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59075 conditions, 15515 events. 9939/15515 cut-off events. For 40995/41854 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 108466 event pairs, 1107 based on Foata normal form. 87/15064 useless extension candidates. Maximal degree in co-relation 59055. Up to 9790 conditions per place. [2022-11-25 17:23:31,161 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 114 selfloop transitions, 12 changer transitions 59/204 dead transitions. [2022-11-25 17:23:31,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 204 transitions, 1870 flow [2022-11-25 17:23:31,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 998 transitions. [2022-11-25 17:23:31,165 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48329297820823247 [2022-11-25 17:23:31,165 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 998 transitions. [2022-11-25 17:23:31,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 998 transitions. [2022-11-25 17:23:31,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:31,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 998 transitions. [2022-11-25 17:23:31,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.57142857142858) internal successors, (998), 7 states have internal predecessors, (998), 0 states have call successors, (0), 0 states 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:23:31,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states 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:23:31,174 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states 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:23:31,174 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 627 flow. Second operand 7 states and 998 transitions. [2022-11-25 17:23:31,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 204 transitions, 1870 flow [2022-11-25 17:23:34,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 204 transitions, 1627 flow, removed 72 selfloop flow, removed 4 redundant places. [2022-11-25 17:23:34,107 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 632 flow [2022-11-25 17:23:34,107 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=632, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2022-11-25 17:23:34,108 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2022-11-25 17:23:34,109 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 632 flow [2022-11-25 17:23:34,109 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:23:34,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:34,110 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:23:34,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:23:34,110 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -101307387, now seen corresponding path program 2 times [2022-11-25 17:23:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:34,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667113028] [2022-11-25 17:23:34,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:34,430 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:23:34,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:34,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667113028] [2022-11-25 17:23:34,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667113028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:34,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:34,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:23:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600256931] [2022-11-25 17:23:34,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:34,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:23:34,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:34,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:23:34,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:34,449 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 17:23:34,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 632 flow. Second operand has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states 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:23:34,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:34,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 17:23:34,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:35,724 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][120], [Black: 194#true, Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 95#L789true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 77#L2true, 73#L773true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 236#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 2), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#true, 115#L826true, 241#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, Black: 248#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 243#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 246#(not (= ~__unbuffered_p3_EBX~0 0))]) [2022-11-25 17:23:35,724 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:35,724 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:35,724 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:35,724 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:35,725 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][120], [Black: 194#true, Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 95#L789true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 73#L773true, 77#L2true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 236#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 2), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#true, 115#L826true, 241#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, Black: 248#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 243#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 246#(not (= ~__unbuffered_p3_EBX~0 0))]) [2022-11-25 17:23:35,725 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:23:35,725 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:35,725 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:35,725 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:23:36,000 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][148], [104#L766true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 95#L789true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 194#true, 165#true, 67#P2EXITtrue, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 77#L2true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 97#L845true, Black: 236#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 2), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 241#true, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 248#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 243#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 246#(not (= ~__unbuffered_p3_EBX~0 0)), 178#true]) [2022-11-25 17:23:36,000 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,000 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,000 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,000 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,000 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][120], [Black: 194#true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 95#L789true, Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, 58#L829true, P3Thread1of1ForFork1InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork2InUse, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork0InUse, 73#L773true, 77#L2true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 2), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#true, 241#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, Black: 248#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 243#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 246#(not (= ~__unbuffered_p3_EBX~0 0))]) [2022-11-25 17:23:36,001 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,001 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,001 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,001 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,003 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][148], [104#L766true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 95#L789true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 194#true, 165#true, 67#P2EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 77#L2true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 97#L845true, Black: 236#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 2), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 241#true, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 248#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 243#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), 178#true, Black: 246#(not (= ~__unbuffered_p3_EBX~0 0))]) [2022-11-25 17:23:36,004 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,004 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,004 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,004 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,004 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][120], [Black: 194#true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 95#L789true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(= ~__unbuffered_cnt~0 0), 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, 67#P2EXITtrue, 58#L829true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 215#(<= ~__unbuffered_cnt~0 1), Black: 216#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 73#L773true, 77#L2true, 191#(and (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 236#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 197#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 229#(<= ~__unbuffered_cnt~0 2), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#true, 241#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, Black: 248#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 243#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 246#(not (= ~__unbuffered_p3_EBX~0 0))]) [2022-11-25 17:23:36,004 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,004 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,005 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,005 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:23:36,564 INFO L130 PetriNetUnfolder]: 8659/13251 cut-off events. [2022-11-25 17:23:36,564 INFO L131 PetriNetUnfolder]: For 29961/30865 co-relation queries the response was YES. [2022-11-25 17:23:36,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50877 conditions, 13251 events. 8659/13251 cut-off events. For 29961/30865 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 90260 event pairs, 734 based on Foata normal form. 121/12780 useless extension candidates. Maximal degree in co-relation 50852. Up to 3364 conditions per place. [2022-11-25 17:23:36,645 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 158 selfloop transitions, 33 changer transitions 18/228 dead transitions. [2022-11-25 17:23:36,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 228 transitions, 1900 flow [2022-11-25 17:23:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:23:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:23:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1563 transitions. [2022-11-25 17:23:36,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48166409861325116 [2022-11-25 17:23:36,650 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1563 transitions. [2022-11-25 17:23:36,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1563 transitions. [2022-11-25 17:23:36,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:36,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1563 transitions. [2022-11-25 17:23:36,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 142.0909090909091) internal successors, (1563), 11 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states 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:23:36,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 295.0) internal successors, (3540), 12 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states 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:23:36,661 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 295.0) internal successors, (3540), 12 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states 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:23:36,661 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 632 flow. Second operand 11 states and 1563 transitions. [2022-11-25 17:23:36,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 228 transitions, 1900 flow [2022-11-25 17:23:37,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 228 transitions, 1886 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:23:37,938 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 712 flow [2022-11-25 17:23:37,938 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=712, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2022-11-25 17:23:37,939 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2022-11-25 17:23:37,939 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 712 flow [2022-11-25 17:23:37,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states 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:23:37,940 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:37,940 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:37,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:23:37,940 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1806241828, now seen corresponding path program 1 times [2022-11-25 17:23:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:37,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579039711] [2022-11-25 17:23:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:38,215 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:23:38,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:38,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579039711] [2022-11-25 17:23:38,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579039711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:38,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:38,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441607375] [2022-11-25 17:23:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:38,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:38,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:38,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:38,243 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 295 [2022-11-25 17:23:38,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 712 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:23:38,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:38,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 295 [2022-11-25 17:23:38,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:41,298 INFO L130 PetriNetUnfolder]: 18106/25990 cut-off events. [2022-11-25 17:23:41,298 INFO L131 PetriNetUnfolder]: For 94001/94001 co-relation queries the response was YES. [2022-11-25 17:23:41,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113618 conditions, 25990 events. 18106/25990 cut-off events. For 94001/94001 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 159740 event pairs, 1105 based on Foata normal form. 1/25991 useless extension candidates. Maximal degree in co-relation 113592. Up to 8247 conditions per place. [2022-11-25 17:23:41,448 INFO L137 encePairwiseOnDemand]: 284/295 looper letters, 99 selfloop transitions, 24 changer transitions 168/291 dead transitions. [2022-11-25 17:23:41,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 291 transitions, 2910 flow [2022-11-25 17:23:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:23:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:23:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions. [2022-11-25 17:23:41,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47005649717514125 [2022-11-25 17:23:41,452 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 832 transitions. [2022-11-25 17:23:41,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions. [2022-11-25 17:23:41,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:41,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions. [2022-11-25 17:23:41,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 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:23:41,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:23:41,459 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:23:41,459 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 712 flow. Second operand 6 states and 832 transitions. [2022-11-25 17:23:41,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 291 transitions, 2910 flow [2022-11-25 17:23:43,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 291 transitions, 2487 flow, removed 81 selfloop flow, removed 10 redundant places. [2022-11-25 17:23:43,818 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 520 flow [2022-11-25 17:23:43,819 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2022-11-25 17:23:43,819 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2022-11-25 17:23:43,819 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 520 flow [2022-11-25 17:23:43,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:23:43,820 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:43,820 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:43,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:23:43,821 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:43,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1761939684, now seen corresponding path program 2 times [2022-11-25 17:23:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:43,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074081551] [2022-11-25 17:23:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:44,072 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:23:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:44,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074081551] [2022-11-25 17:23:44,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074081551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:44,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:44,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417187523] [2022-11-25 17:23:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:44,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:44,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:44,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:44,102 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 295 [2022-11-25 17:23:44,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 520 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:23:44,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:44,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 295 [2022-11-25 17:23:44,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:45,143 INFO L130 PetriNetUnfolder]: 4362/6852 cut-off events. [2022-11-25 17:23:45,143 INFO L131 PetriNetUnfolder]: For 20010/20010 co-relation queries the response was YES. [2022-11-25 17:23:45,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27905 conditions, 6852 events. 4362/6852 cut-off events. For 20010/20010 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 38946 event pairs, 831 based on Foata normal form. 2/6854 useless extension candidates. Maximal degree in co-relation 27880. Up to 2285 conditions per place. [2022-11-25 17:23:45,197 INFO L137 encePairwiseOnDemand]: 285/295 looper letters, 92 selfloop transitions, 13 changer transitions 70/175 dead transitions. [2022-11-25 17:23:45,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 175 transitions, 1496 flow [2022-11-25 17:23:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:23:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 700 transitions. [2022-11-25 17:23:45,200 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4745762711864407 [2022-11-25 17:23:45,200 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 700 transitions. [2022-11-25 17:23:45,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 700 transitions. [2022-11-25 17:23:45,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:45,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 700 transitions. [2022-11-25 17:23:45,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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:23:45,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states 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:23:45,207 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states 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:23:45,207 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 520 flow. Second operand 5 states and 700 transitions. [2022-11-25 17:23:45,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 175 transitions, 1496 flow [2022-11-25 17:23:45,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 175 transitions, 1446 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-11-25 17:23:45,363 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 414 flow [2022-11-25 17:23:45,364 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=414, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2022-11-25 17:23:45,364 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places. [2022-11-25 17:23:45,364 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 414 flow [2022-11-25 17:23:45,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:23:45,365 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:45,365 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:45,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:23:45,366 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -745291946, now seen corresponding path program 3 times [2022-11-25 17:23:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:45,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002049287] [2022-11-25 17:23:45,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:46,804 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:23:46,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:46,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002049287] [2022-11-25 17:23:46,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002049287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:46,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:46,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:23:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706945751] [2022-11-25 17:23:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:46,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:23:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:23:46,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:23:46,867 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 17:23:46,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 414 flow. Second operand has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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:23:46,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:46,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 17:23:46,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:47,818 INFO L130 PetriNetUnfolder]: 1554/2621 cut-off events. [2022-11-25 17:23:47,819 INFO L131 PetriNetUnfolder]: For 6795/6968 co-relation queries the response was YES. [2022-11-25 17:23:47,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10212 conditions, 2621 events. 1554/2621 cut-off events. For 6795/6968 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14394 event pairs, 279 based on Foata normal form. 39/2594 useless extension candidates. Maximal degree in co-relation 10191. Up to 1011 conditions per place. [2022-11-25 17:23:47,832 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 80 selfloop transitions, 7 changer transitions 53/153 dead transitions. [2022-11-25 17:23:47,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 153 transitions, 1211 flow [2022-11-25 17:23:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 985 transitions. [2022-11-25 17:23:47,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47699757869249393 [2022-11-25 17:23:47,837 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 985 transitions. [2022-11-25 17:23:47,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 985 transitions. [2022-11-25 17:23:47,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:47,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 985 transitions. [2022-11-25 17:23:47,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.71428571428572) internal successors, (985), 7 states have internal predecessors, (985), 0 states have call successors, (0), 0 states 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:23:47,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states 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:23:47,846 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states 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:23:47,846 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 414 flow. Second operand 7 states and 985 transitions. [2022-11-25 17:23:47,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 153 transitions, 1211 flow [2022-11-25 17:23:47,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 153 transitions, 1155 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-25 17:23:47,898 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 421 flow [2022-11-25 17:23:47,899 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=421, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2022-11-25 17:23:47,900 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2022-11-25 17:23:47,900 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 421 flow [2022-11-25 17:23:47,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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:23:47,901 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:47,901 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:47,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:23:47,902 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1461566970, now seen corresponding path program 4 times [2022-11-25 17:23:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:47,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865498747] [2022-11-25 17:23:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:48,200 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:23:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:48,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865498747] [2022-11-25 17:23:48,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865498747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:48,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:48,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:23:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051743356] [2022-11-25 17:23:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:48,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:23:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:48,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:23:48,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:23:48,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 295 [2022-11-25 17:23:48,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:23:48,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:48,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 295 [2022-11-25 17:23:48,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:48,984 INFO L130 PetriNetUnfolder]: 1933/3265 cut-off events. [2022-11-25 17:23:48,984 INFO L131 PetriNetUnfolder]: For 8098/8167 co-relation queries the response was YES. [2022-11-25 17:23:49,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13554 conditions, 3265 events. 1933/3265 cut-off events. For 8098/8167 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 18490 event pairs, 617 based on Foata normal form. 1/3213 useless extension candidates. Maximal degree in co-relation 13533. Up to 1800 conditions per place. [2022-11-25 17:23:49,008 INFO L137 encePairwiseOnDemand]: 292/295 looper letters, 46 selfloop transitions, 2 changer transitions 49/101 dead transitions. [2022-11-25 17:23:49,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 101 transitions, 834 flow [2022-11-25 17:23:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:23:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:23:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2022-11-25 17:23:49,011 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5028248587570622 [2022-11-25 17:23:49,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2022-11-25 17:23:49,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2022-11-25 17:23:49,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:49,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2022-11-25 17:23:49,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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:23:49,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:23:49,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:23:49,017 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 421 flow. Second operand 3 states and 445 transitions. [2022-11-25 17:23:49,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 101 transitions, 834 flow [2022-11-25 17:23:49,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 101 transitions, 799 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-11-25 17:23:49,084 INFO L231 Difference]: Finished difference. Result has 76 places, 46 transitions, 269 flow [2022-11-25 17:23:49,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=76, PETRI_TRANSITIONS=46} [2022-11-25 17:23:49,086 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places. [2022-11-25 17:23:49,086 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 46 transitions, 269 flow [2022-11-25 17:23:49,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:23:49,087 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:49,087 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:49,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:23:49,088 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:23:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash -923078400, now seen corresponding path program 5 times [2022-11-25 17:23:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:49,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360089870] [2022-11-25 17:23:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:23:49,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:23:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:23:49,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:23:49,383 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:23:49,386 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 17:23:49,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 17:23:49,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 17:23:49,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 17:23:49,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 17:23:49,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 17:23:49,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 17:23:49,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 17:23:49,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 17:23:49,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 17:23:49,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 17:23:49,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 17:23:49,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 17:23:49,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 17:23:49,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 17:23:49,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 17:23:49,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:23:49,401 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:49,408 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:23:49,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:23:49,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:23:49 BasicIcfg [2022-11-25 17:23:49,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:23:49,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:23:49,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:23:49,562 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:23:49,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:22:48" (3/4) ... [2022-11-25 17:23:49,566 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:23:49,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:23:49,567 INFO L158 Benchmark]: Toolchain (without parser) took 62855.86ms. Allocated memory was 123.7MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 90.3MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2022-11-25 17:23:49,567 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:23:49,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.37ms. Allocated memory is still 123.7MB. Free memory was 90.3MB in the beginning and 61.4MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.66ms. Allocated memory is still 123.7MB. Free memory was 61.4MB in the beginning and 58.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,568 INFO L158 Benchmark]: Boogie Preprocessor took 34.85ms. Allocated memory is still 123.7MB. Free memory was 58.8MB in the beginning and 56.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,569 INFO L158 Benchmark]: RCFGBuilder took 1128.95ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 56.9MB in the beginning and 92.7MB in the end (delta: -35.8MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,569 INFO L158 Benchmark]: TraceAbstraction took 60847.67ms. Allocated memory was 157.3MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 92.7MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2022-11-25 17:23:49,570 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 8.7GB. Free memory is still 4.6GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:23:49,571 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.37ms. Allocated memory is still 123.7MB. Free memory was 90.3MB in the beginning and 61.4MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.66ms. Allocated memory is still 123.7MB. Free memory was 61.4MB in the beginning and 58.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.85ms. Allocated memory is still 123.7MB. Free memory was 58.8MB in the beginning and 56.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1128.95ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 56.9MB in the beginning and 92.7MB in the end (delta: -35.8MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 60847.67ms. Allocated memory was 157.3MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 92.7MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 8.7GB. Free memory is still 4.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 158 PlacesBefore, 54 PlacesAfterwards, 147 TransitionsBefore, 42 TransitionsAfterwards, 3922 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 11423 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4928, independent: 4676, independent conditional: 0, independent unconditional: 4676, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2597, independent conditional: 0, independent unconditional: 2597, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2555, independent conditional: 0, independent unconditional: 2555, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 712, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 638, dependent conditional: 0, dependent unconditional: 638, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4928, independent: 2079, independent conditional: 0, independent unconditional: 2079, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 342, Positive conditional cache size: 0, Positive unconditional cache size: 342, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=-3, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-2, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=-1, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t604; [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 189 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 60.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 46.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1130 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 943 mSDsluCounter, 326 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2589 IncrementalHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 65 mSDtfsCounter, 2589 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=712occurred in iteration=11, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 2077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:23:49,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/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_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/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 b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --- 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:23:52,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:23:52,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:23:52,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:23:52,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:23:52,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:23:52,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:23:52,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:23:52,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:23:52,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:23:52,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:23:52,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:23:52,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:23:52,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:23:52,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:23:52,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:23:52,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:23:52,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:23:52,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:23:52,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:23:52,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:23:52,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:23:52,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:23:52,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:23:52,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:23:52,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:23:52,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:23:52,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:23:52,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:23:52,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:23:52,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:23:52,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:23:52,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:23:52,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:23:52,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:23:52,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:23:52,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:23:52,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:23:52,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:23:52,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:23:52,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:23:52,589 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:23:52,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:23:52,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:23:52,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:23:52,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:23:52,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:23:52,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:23:52,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:23:52,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:23:52,637 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:23:52,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:23:52,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:23:52,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:23:52,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:23:52,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:23:52,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:23:52,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:23:52,640 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:23:52,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:23:52,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:23:52,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:23:52,641 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:23:52,641 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:23:52,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:23:52,642 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:23:52,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:23:52,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:23:52,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:23:52,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:23:52,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:23:52,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:23:52,643 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:23:52,643 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:23:52,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:23:52,644 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:23:52,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:23:52,644 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:23:52,645 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_c81a5396-a283-4950-b4b1-099e1483a71c/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_c81a5396-a283-4950-b4b1-099e1483a71c/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 -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 [2022-11-25 17:23:53,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:23:53,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:23:53,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:23:53,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:23:53,112 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:23:53,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:23:56,143 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:23:56,518 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:23:56,519 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:23:56,533 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/data/22de4f8af/4aa62310d34443789c1973baf42727a6/FLAG1f607741a [2022-11-25 17:23:56,554 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/data/22de4f8af/4aa62310d34443789c1973baf42727a6 [2022-11-25 17:23:56,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:23:56,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:23:56,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:23:56,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:23:56,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:23:56,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:56" (1/1) ... [2022-11-25 17:23:56,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20854335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:56, skipping insertion in model container [2022-11-25 17:23:56,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:56" (1/1) ... [2022-11-25 17:23:56,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:23:56,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:23:56,823 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_c81a5396-a283-4950-b4b1-099e1483a71c/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:23:57,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:23:57,159 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:23:57,176 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_c81a5396-a283-4950-b4b1-099e1483a71c/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:23:57,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:57,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:57,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:23:57,305 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:23:57,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57 WrapperNode [2022-11-25 17:23:57,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:23:57,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:23:57,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:23:57,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:23:57,316 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:23:57" (1/1) ... [2022-11-25 17:23:57,336 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:23:57" (1/1) ... [2022-11-25 17:23:57,362 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-25 17:23:57,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:23:57,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:23:57,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:23:57,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:23:57,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,396 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:23:57,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:23:57,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:23:57,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:23:57,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (1/1) ... [2022-11-25 17:23:57,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:23:57,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:57,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:23:57,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:23:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:23:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:23:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:23:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:23:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:23:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:23:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:23:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:23:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:23:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:23:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:23:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:23:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:23:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:23:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:23:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:23:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:23:57,551 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:23:57,783 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:23:57,785 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:23:58,460 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:23:58,635 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:23:58,636 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:23:58,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:58 BoogieIcfgContainer [2022-11-25 17:23:58,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:23:58,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:23:58,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:23:58,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:23:58,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:23:56" (1/3) ... [2022-11-25 17:23:58,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3f9eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:23:58, skipping insertion in model container [2022-11-25 17:23:58,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:57" (2/3) ... [2022-11-25 17:23:58,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3f9eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:23:58, skipping insertion in model container [2022-11-25 17:23:58,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:58" (3/3) ... [2022-11-25 17:23:58,658 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:23:58,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:23:58,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 17:23:58,681 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:23:58,788 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:23:58,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-11-25 17:23:58,972 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-25 17:23:58,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:58,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 17:23:58,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-11-25 17:23:58,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-11-25 17:23:59,002 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:23:59,030 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2022-11-25 17:23:59,039 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2022-11-25 17:23:59,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2022-11-25 17:23:59,113 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-25 17:23:59,113 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-25 17:23:59,119 INFO L119 LiptonReduction]: Number of co-enabled transitions 3922 [2022-11-25 17:24:10,707 INFO L134 LiptonReduction]: Checked pairs total: 11339 [2022-11-25 17:24:10,708 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-25 17:24:10,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:24:10,734 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;@463342a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:24:10,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:24:10,736 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:24:10,736 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:24:10,736 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:10,737 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:24:10,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 636, now seen corresponding path program 1 times [2022-11-25 17:24:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:10,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200313636] [2022-11-25 17:24:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:10,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:10,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:10,771 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:10,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:24:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:10,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:24:10,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:10,907 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:24:10,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:10,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:10,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200313636] [2022-11-25 17:24:10,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200313636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:10,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:10,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:24:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177617950] [2022-11-25 17:24:10,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:10,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:24:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:10,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:24:10,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:24:10,970 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2022-11-25 17:24:10,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:24:10,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:10,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2022-11-25 17:24:10,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:13,303 INFO L130 PetriNetUnfolder]: 8719/11814 cut-off events. [2022-11-25 17:24:13,304 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-11-25 17:24:13,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23762 conditions, 11814 events. 8719/11814 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 63282 event pairs, 8719 based on Foata normal form. 0/10306 useless extension candidates. Maximal degree in co-relation 23750. Up to 11731 conditions per place. [2022-11-25 17:24:13,403 INFO L137 encePairwiseOnDemand]: 288/297 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2022-11-25 17:24:13,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2022-11-25 17:24:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:24:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:24:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 311 transitions. [2022-11-25 17:24:13,426 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5235690235690236 [2022-11-25 17:24:13,427 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 311 transitions. [2022-11-25 17:24:13,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 311 transitions. [2022-11-25 17:24:13,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:13,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 311 transitions. [2022-11-25 17:24:13,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:24:13,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states 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:24:13,452 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states 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:24:13,455 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 311 transitions. [2022-11-25 17:24:13,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2022-11-25 17:24:13,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:24:13,466 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2022-11-25 17:24:13,468 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-11-25 17:24:13,472 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-11-25 17:24:13,473 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2022-11-25 17:24:13,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:24:13,473 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:13,474 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:24:13,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:13,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:13,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash 626907, now seen corresponding path program 1 times [2022-11-25 17:24:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:13,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105160049] [2022-11-25 17:24:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:13,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:13,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:13,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:24:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:13,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:24:13,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:13,825 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:24:13,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:13,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:13,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105160049] [2022-11-25 17:24:13,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105160049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:13,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:13,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:24:13,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533892158] [2022-11-25 17:24:13,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:13,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:24:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:13,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:24:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:24:13,833 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 297 [2022-11-25 17:24:13,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:24:13,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:13,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 297 [2022-11-25 17:24:13,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:15,450 INFO L130 PetriNetUnfolder]: 6855/9351 cut-off events. [2022-11-25 17:24:15,451 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:24:15,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18788 conditions, 9351 events. 6855/9351 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 48420 event pairs, 3527 based on Foata normal form. 0/8689 useless extension candidates. Maximal degree in co-relation 18785. Up to 7399 conditions per place. [2022-11-25 17:24:15,512 INFO L137 encePairwiseOnDemand]: 294/297 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2022-11-25 17:24:15,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2022-11-25 17:24:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:24:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:24:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2022-11-25 17:24:15,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5140291806958474 [2022-11-25 17:24:15,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2022-11-25 17:24:15,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2022-11-25 17:24:15,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:15,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2022-11-25 17:24:15,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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:24:15,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states 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:24:15,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states 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:24:15,521 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 458 transitions. [2022-11-25 17:24:15,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2022-11-25 17:24:15,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:24:15,523 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2022-11-25 17:24:15,523 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-11-25 17:24:15,524 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-11-25 17:24:15,524 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2022-11-25 17:24:15,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:24:15,525 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:15,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:15,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:15,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:15,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash -109727258, now seen corresponding path program 1 times [2022-11-25 17:24:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:15,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068792472] [2022-11-25 17:24:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:15,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:15,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:15,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:24:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:15,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:24:15,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:15,971 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:24:15,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:15,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:15,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068792472] [2022-11-25 17:24:15,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068792472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:15,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:15,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:24:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095220978] [2022-11-25 17:24:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:15,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:24:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:15,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:24:15,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:24:15,994 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2022-11-25 17:24:15,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:24:15,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:15,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2022-11-25 17:24:15,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:16,917 INFO L130 PetriNetUnfolder]: 3719/5311 cut-off events. [2022-11-25 17:24:16,918 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-11-25 17:24:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11096 conditions, 5311 events. 3719/5311 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28336 event pairs, 803 based on Foata normal form. 108/5182 useless extension candidates. Maximal degree in co-relation 11092. Up to 4756 conditions per place. [2022-11-25 17:24:16,962 INFO L137 encePairwiseOnDemand]: 291/297 looper letters, 40 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2022-11-25 17:24:16,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 210 flow [2022-11-25 17:24:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:24:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:24:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-25 17:24:16,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49607182940516276 [2022-11-25 17:24:16,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-25 17:24:16,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-25 17:24:16,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:16,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-25 17:24:16,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:24:16,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states 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:24:16,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states 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:24:16,974 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 442 transitions. [2022-11-25 17:24:16,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 210 flow [2022-11-25 17:24:16,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:24:16,977 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 103 flow [2022-11-25 17:24:16,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-11-25 17:24:16,979 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-11-25 17:24:16,980 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 103 flow [2022-11-25 17:24:16,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:24:16,981 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:16,981 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:24:16,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:17,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:17,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1731469391, now seen corresponding path program 1 times [2022-11-25 17:24:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:17,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538255239] [2022-11-25 17:24:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:17,199 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:17,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:24:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:17,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:24:17,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:17,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:17,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:17,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538255239] [2022-11-25 17:24:17,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538255239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:17,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:17,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045130842] [2022-11-25 17:24:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:17,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:17,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:17,425 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2022-11-25 17:24:17,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:24:17,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:17,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2022-11-25 17:24:17,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:18,134 INFO L130 PetriNetUnfolder]: 1694/2611 cut-off events. [2022-11-25 17:24:18,135 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2022-11-25 17:24:18,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6268 conditions, 2611 events. 1694/2611 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13712 event pairs, 402 based on Foata normal form. 135/2644 useless extension candidates. Maximal degree in co-relation 6263. Up to 1426 conditions per place. [2022-11-25 17:24:18,149 INFO L137 encePairwiseOnDemand]: 291/297 looper letters, 53 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2022-11-25 17:24:18,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 309 flow [2022-11-25 17:24:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:24:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2022-11-25 17:24:18,152 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49747474747474746 [2022-11-25 17:24:18,152 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2022-11-25 17:24:18,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2022-11-25 17:24:18,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:18,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2022-11-25 17:24:18,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:24:18,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states 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:24:18,158 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states 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:24:18,159 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 103 flow. Second operand 4 states and 591 transitions. [2022-11-25 17:24:18,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 309 flow [2022-11-25 17:24:18,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:24:18,163 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 150 flow [2022-11-25 17:24:18,163 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-11-25 17:24:18,165 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2022-11-25 17:24:18,165 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 150 flow [2022-11-25 17:24:18,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:24:18,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:18,166 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:24:18,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:18,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:18,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1533145804, now seen corresponding path program 1 times [2022-11-25 17:24:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:18,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449414669] [2022-11-25 17:24:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:18,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:18,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:18,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:18,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:24:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:18,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:24:18,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:18,617 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:24:18,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:18,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:18,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449414669] [2022-11-25 17:24:18,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449414669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:18,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:18,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:18,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144990654] [2022-11-25 17:24:18,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:18,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:18,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:18,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2022-11-25 17:24:18,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 150 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:24:18,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:18,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2022-11-25 17:24:18,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:19,186 INFO L130 PetriNetUnfolder]: 1064/1666 cut-off events. [2022-11-25 17:24:19,186 INFO L131 PetriNetUnfolder]: For 1146/1146 co-relation queries the response was YES. [2022-11-25 17:24:19,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 1666 events. 1064/1666 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8260 event pairs, 331 based on Foata normal form. 63/1690 useless extension candidates. Maximal degree in co-relation 4531. Up to 630 conditions per place. [2022-11-25 17:24:19,198 INFO L137 encePairwiseOnDemand]: 291/297 looper letters, 64 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2022-11-25 17:24:19,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 418 flow [2022-11-25 17:24:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:24:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2022-11-25 17:24:19,201 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2022-11-25 17:24:19,202 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2022-11-25 17:24:19,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2022-11-25 17:24:19,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:19,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2022-11-25 17:24:19,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states 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:24:19,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states 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:24:19,209 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states 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:24:19,210 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 150 flow. Second operand 5 states and 738 transitions. [2022-11-25 17:24:19,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 418 flow [2022-11-25 17:24:19,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 400 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:24:19,215 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 200 flow [2022-11-25 17:24:19,215 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-11-25 17:24:19,216 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2022-11-25 17:24:19,216 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 200 flow [2022-11-25 17:24:19,217 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:24:19,217 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:19,217 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:24:19,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:19,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:19,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:19,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash 721967424, now seen corresponding path program 1 times [2022-11-25 17:24:19,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:19,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820913608] [2022-11-25 17:24:19,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:19,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:19,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:19,434 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:19,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:24:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:19,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:24:19,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:19,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:19,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:19,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820913608] [2022-11-25 17:24:19,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820913608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:19,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:19,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926287231] [2022-11-25 17:24:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:19,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:19,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:19,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:19,725 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2022-11-25 17:24:19,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states 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:24:19,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:19,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2022-11-25 17:24:19,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:20,365 INFO L130 PetriNetUnfolder]: 999/1536 cut-off events. [2022-11-25 17:24:20,367 INFO L131 PetriNetUnfolder]: For 1309/1309 co-relation queries the response was YES. [2022-11-25 17:24:20,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 1536 events. 999/1536 cut-off events. For 1309/1309 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7583 event pairs, 326 based on Foata normal form. 13/1523 useless extension candidates. Maximal degree in co-relation 4337. Up to 630 conditions per place. [2022-11-25 17:24:20,380 INFO L137 encePairwiseOnDemand]: 291/297 looper letters, 60 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2022-11-25 17:24:20,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 444 flow [2022-11-25 17:24:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:24:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:24:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2022-11-25 17:24:20,384 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4882154882154882 [2022-11-25 17:24:20,384 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 870 transitions. [2022-11-25 17:24:20,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 870 transitions. [2022-11-25 17:24:20,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:20,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 870 transitions. [2022-11-25 17:24:20,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states 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:24:20,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states 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:24:20,393 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states 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:24:20,394 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 200 flow. Second operand 6 states and 870 transitions. [2022-11-25 17:24:20,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 444 flow [2022-11-25 17:24:20,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 410 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 17:24:20,417 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 210 flow [2022-11-25 17:24:20,418 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-11-25 17:24:20,421 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2022-11-25 17:24:20,421 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 210 flow [2022-11-25 17:24:20,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states 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:24:20,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:20,422 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:20,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:20,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:20,646 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash 845315504, now seen corresponding path program 1 times [2022-11-25 17:24:20,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:20,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817419760] [2022-11-25 17:24:20,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:20,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:20,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:20,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:20,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:24:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:20,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:24:20,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:21,737 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:24:21,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:21,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:21,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817419760] [2022-11-25 17:24:21,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817419760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:21,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:21,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262590128] [2022-11-25 17:24:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:21,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:21,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:21,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:22,469 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 297 [2022-11-25 17:24:22,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states 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:24:22,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:22,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 297 [2022-11-25 17:24:22,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:23,397 INFO L130 PetriNetUnfolder]: 999/1577 cut-off events. [2022-11-25 17:24:23,398 INFO L131 PetriNetUnfolder]: For 1937/1937 co-relation queries the response was YES. [2022-11-25 17:24:23,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 1577 events. 999/1577 cut-off events. For 1937/1937 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8103 event pairs, 28 based on Foata normal form. 0/1573 useless extension candidates. Maximal degree in co-relation 4462. Up to 1252 conditions per place. [2022-11-25 17:24:23,410 INFO L137 encePairwiseOnDemand]: 292/297 looper letters, 59 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2022-11-25 17:24:23,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 467 flow [2022-11-25 17:24:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:24:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:24:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2022-11-25 17:24:23,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4186307519640853 [2022-11-25 17:24:23,414 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2022-11-25 17:24:23,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2022-11-25 17:24:23,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:23,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2022-11-25 17:24:23,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states 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:24:23,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states 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:24:23,421 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states 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:24:23,422 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 210 flow. Second operand 6 states and 746 transitions. [2022-11-25 17:24:23,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 467 flow [2022-11-25 17:24:23,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 392 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-25 17:24:23,429 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 166 flow [2022-11-25 17:24:23,429 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-11-25 17:24:23,430 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2022-11-25 17:24:23,430 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 166 flow [2022-11-25 17:24:23,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states 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:24:23,431 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:23,431 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:23,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:23,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:23,645 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1723829812, now seen corresponding path program 1 times [2022-11-25 17:24:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:23,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166925166] [2022-11-25 17:24:23,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:23,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:23,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:23,648 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:23,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:24:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:23,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:24:23,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:24,440 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:24:24,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:24,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:24,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166925166] [2022-11-25 17:24:24,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166925166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:24,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:24,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:24:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857817835] [2022-11-25 17:24:24,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:24,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:24:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:24,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:24:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:24:24,579 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 297 [2022-11-25 17:24:24,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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:24:24,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:24,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 297 [2022-11-25 17:24:24,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:25,487 INFO L130 PetriNetUnfolder]: 1159/1890 cut-off events. [2022-11-25 17:24:25,490 INFO L131 PetriNetUnfolder]: For 1123/1123 co-relation queries the response was YES. [2022-11-25 17:24:25,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4997 conditions, 1890 events. 1159/1890 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10526 event pairs, 145 based on Foata normal form. 1/1882 useless extension candidates. Maximal degree in co-relation 4989. Up to 773 conditions per place. [2022-11-25 17:24:25,505 INFO L137 encePairwiseOnDemand]: 290/297 looper letters, 69 selfloop transitions, 4 changer transitions 32/110 dead transitions. [2022-11-25 17:24:25,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 672 flow [2022-11-25 17:24:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:24:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1110 transitions. [2022-11-25 17:24:25,510 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4671717171717172 [2022-11-25 17:24:25,511 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1110 transitions. [2022-11-25 17:24:25,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1110 transitions. [2022-11-25 17:24:25,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:25,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1110 transitions. [2022-11-25 17:24:25,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.75) internal successors, (1110), 8 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:25,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states 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:24:25,522 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 297.0) internal successors, (2673), 9 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states 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:24:25,522 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 166 flow. Second operand 8 states and 1110 transitions. [2022-11-25 17:24:25,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 672 flow [2022-11-25 17:24:25,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 110 transitions, 655 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:24:25,539 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 175 flow [2022-11-25 17:24:25,539 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2022-11-25 17:24:25,543 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2022-11-25 17:24:25,543 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 175 flow [2022-11-25 17:24:25,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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:24:25,544 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:25,544 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:25,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:25,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:25,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:25,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:25,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2115560036, now seen corresponding path program 2 times [2022-11-25 17:24:25,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:25,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740630924] [2022-11-25 17:24:25,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:24:25,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:25,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:25,766 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:25,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 17:24:25,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:24:25,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:24:25,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:24:25,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:26,000 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:24:26,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:26,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:26,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740630924] [2022-11-25 17:24:26,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740630924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:26,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:26,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800269210] [2022-11-25 17:24:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:26,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:26,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:26,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:26,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:26,024 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2022-11-25 17:24:26,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:24:26,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:26,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2022-11-25 17:24:26,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:26,637 INFO L130 PetriNetUnfolder]: 1736/2724 cut-off events. [2022-11-25 17:24:26,637 INFO L131 PetriNetUnfolder]: For 2080/2080 co-relation queries the response was YES. [2022-11-25 17:24:26,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7722 conditions, 2724 events. 1736/2724 cut-off events. For 2080/2080 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15429 event pairs, 760 based on Foata normal form. 1/2684 useless extension candidates. Maximal degree in co-relation 7711. Up to 1538 conditions per place. [2022-11-25 17:24:26,654 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 57 selfloop transitions, 2 changer transitions 12/75 dead transitions. [2022-11-25 17:24:26,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 464 flow [2022-11-25 17:24:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:24:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 580 transitions. [2022-11-25 17:24:26,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4882154882154882 [2022-11-25 17:24:26,657 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 580 transitions. [2022-11-25 17:24:26,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 580 transitions. [2022-11-25 17:24:26,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:26,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 580 transitions. [2022-11-25 17:24:26,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:24:26,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states 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:24:26,664 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states 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:24:26,664 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 175 flow. Second operand 4 states and 580 transitions. [2022-11-25 17:24:26,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 464 flow [2022-11-25 17:24:26,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 446 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-25 17:24:26,700 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 173 flow [2022-11-25 17:24:26,700 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-11-25 17:24:26,701 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2022-11-25 17:24:26,701 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 173 flow [2022-11-25 17:24:26,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:24:26,702 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:26,702 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:26,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:26,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:26,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:26,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash 932968276, now seen corresponding path program 3 times [2022-11-25 17:24:26,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:26,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046293088] [2022-11-25 17:24:26,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:24:26,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:26,929 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:26,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 17:24:27,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:24:27,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:24:27,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:24:27,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:27,200 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:24:27,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:27,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:27,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046293088] [2022-11-25 17:24:27,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046293088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:27,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:27,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023737487] [2022-11-25 17:24:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:27,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:27,232 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2022-11-25 17:24:27,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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:24:27,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:27,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2022-11-25 17:24:27,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:27,799 INFO L130 PetriNetUnfolder]: 1262/2055 cut-off events. [2022-11-25 17:24:27,800 INFO L131 PetriNetUnfolder]: For 1518/1518 co-relation queries the response was YES. [2022-11-25 17:24:27,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5816 conditions, 2055 events. 1262/2055 cut-off events. For 1518/1518 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10561 event pairs, 203 based on Foata normal form. 1/2050 useless extension candidates. Maximal degree in co-relation 5805. Up to 1018 conditions per place. [2022-11-25 17:24:27,807 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 53 selfloop transitions, 1 changer transitions 30/88 dead transitions. [2022-11-25 17:24:27,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 551 flow [2022-11-25 17:24:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:24:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2022-11-25 17:24:27,810 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-11-25 17:24:27,810 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2022-11-25 17:24:27,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2022-11-25 17:24:27,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:27,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2022-11-25 17:24:27,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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:24:27,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states 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:24:27,816 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states 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:24:27,817 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 173 flow. Second operand 5 states and 715 transitions. [2022-11-25 17:24:27,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 551 flow [2022-11-25 17:24:27,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 539 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:24:27,832 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 174 flow [2022-11-25 17:24:27,833 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2022-11-25 17:24:27,833 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2022-11-25 17:24:27,833 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 174 flow [2022-11-25 17:24:27,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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:24:27,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:27,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:27,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:28,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:28,047 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash -928217086, now seen corresponding path program 4 times [2022-11-25 17:24:28,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:28,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721320177] [2022-11-25 17:24:28,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:24:28,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:28,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:28,051 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:28,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 17:24:28,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:24:28,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:24:28,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:24:28,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:28,262 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:24:28,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:28,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:28,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721320177] [2022-11-25 17:24:28,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721320177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:28,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:28,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516977410] [2022-11-25 17:24:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:28,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:28,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:28,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:28,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 297 [2022-11-25 17:24:28,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:24:28,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:28,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 297 [2022-11-25 17:24:28,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:28,699 INFO L130 PetriNetUnfolder]: 1342/2187 cut-off events. [2022-11-25 17:24:28,699 INFO L131 PetriNetUnfolder]: For 2033/2041 co-relation queries the response was YES. [2022-11-25 17:24:28,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 2187 events. 1342/2187 cut-off events. For 2033/2041 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11349 event pairs, 516 based on Foata normal form. 1/2161 useless extension candidates. Maximal degree in co-relation 6111. Up to 1147 conditions per place. [2022-11-25 17:24:28,714 INFO L137 encePairwiseOnDemand]: 293/297 looper letters, 44 selfloop transitions, 2 changer transitions 21/71 dead transitions. [2022-11-25 17:24:28,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 440 flow [2022-11-25 17:24:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:24:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2022-11-25 17:24:28,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-11-25 17:24:28,717 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2022-11-25 17:24:28,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2022-11-25 17:24:28,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:28,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2022-11-25 17:24:28,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:24:28,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states 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:24:28,722 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states 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:24:28,722 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 174 flow. Second operand 4 states and 576 transitions. [2022-11-25 17:24:28,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 440 flow [2022-11-25 17:24:28,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 433 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:24:28,742 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 179 flow [2022-11-25 17:24:28,742 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2022-11-25 17:24:28,743 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2022-11-25 17:24:28,743 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 179 flow [2022-11-25 17:24:28,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:24:28,744 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:28,744 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:28,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:28,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:28,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:24:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -350247076, now seen corresponding path program 5 times [2022-11-25 17:24:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:28,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140121151] [2022-11-25 17:24:28,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:24:28,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:28,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:28,961 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:24:29,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 17:24:29,184 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:24:29,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:24:29,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:24:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:24:29,379 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:24:29,379 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:24:29,380 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 17:24:29,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 17:24:29,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 17:24:29,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 17:24:29,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 17:24:29,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 17:24:29,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 17:24:29,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 17:24:29,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 17:24:29,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 17:24:29,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 17:24:29,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 17:24:29,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 17:24:29,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 17:24:29,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 17:24:29,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 17:24:29,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:29,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:24:29,605 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:29,610 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:24:29,610 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:24:29,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:24:29 BasicIcfg [2022-11-25 17:24:29,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:24:29,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:24:29,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:24:29,706 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:24:29,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:58" (3/4) ... [2022-11-25 17:24:29,709 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:24:29,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:24:29,710 INFO L158 Benchmark]: Toolchain (without parser) took 33150.47ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 44.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 433.7MB. Max. memory is 16.1GB. [2022-11-25 17:24:29,710 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 71.3MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:24:29,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.32ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 35.5MB in the end (delta: 8.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-11-25 17:24:29,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.94ms. Allocated memory is still 71.3MB. Free memory was 35.5MB in the beginning and 32.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:24:29,711 INFO L158 Benchmark]: Boogie Preprocessor took 46.37ms. Allocated memory is still 71.3MB. Free memory was 32.8MB in the beginning and 30.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:24:29,712 INFO L158 Benchmark]: RCFGBuilder took 1228.93ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 47.8MB in the end (delta: -17.3MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2022-11-25 17:24:29,712 INFO L158 Benchmark]: TraceAbstraction took 31062.99ms. Allocated memory was 86.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 47.2MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 421.7MB. Max. memory is 16.1GB. [2022-11-25 17:24:29,712 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:24:29,714 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 71.3MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 743.32ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 35.5MB in the end (delta: 8.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.94ms. Allocated memory is still 71.3MB. Free memory was 35.5MB in the beginning and 32.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.37ms. Allocated memory is still 71.3MB. Free memory was 32.8MB in the beginning and 30.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1228.93ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 47.8MB in the end (delta: -17.3MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * TraceAbstraction took 31062.99ms. Allocated memory was 86.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 47.2MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 421.7MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.7s, 159 PlacesBefore, 54 PlacesAfterwards, 148 TransitionsBefore, 42 TransitionsAfterwards, 3922 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 11339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4706, independent: 4461, independent conditional: 0, independent unconditional: 4461, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2527, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2527, independent: 2432, independent conditional: 0, independent unconditional: 2432, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 486, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 393, dependent conditional: 0, dependent unconditional: 393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4706, independent: 1994, independent conditional: 0, independent unconditional: 1994, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 2527, unknown conditional: 0, unknown unconditional: 2527] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=0, t601={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=1, t601={3:0}, t602={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=2, t601={3:0}, t602={7:0}, t603={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=3, t601={3:0}, t602={7:0}, t603={11:0}, t604={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={3:0}, t602={7:0}, t603={11:0}, t604={15:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 489 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2034 IncrementalHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 19 mSDtfsCounter, 2034 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 216 ConstructedInterpolants, 18 QuantifiedInterpolants, 1929 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1772 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:24:29,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c81a5396-a283-4950-b4b1-099e1483a71c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample