./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 2329fc70 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_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 12:32:49,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:32:49,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:32:49,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:32:49,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:32:49,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:32:49,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:32:49,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:32:49,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:32:49,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:32:49,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:32:49,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:32:49,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:32:49,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:32:49,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:32:49,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:32:49,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:32:49,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:32:49,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:32:49,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:32:49,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:32:49,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:32:49,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:32:49,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:32:49,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:32:49,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:32:49,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:32:49,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:32:49,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:32:49,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:32:49,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:32:49,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:32:49,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:32:49,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:32:49,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:32:49,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:32:49,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:32:49,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:32:49,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:32:49,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:32:49,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:32:49,372 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 12:32:49,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:32:49,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:32:49,386 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:32:49,386 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:32:49,387 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:32:49,387 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:32:49,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:32:49,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:32:49,387 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:32:49,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:32:49,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:32:49,389 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:32:49,389 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:32:49,389 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:32:49,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:32:49,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:32:49,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:32:49,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:32:49,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:32:49,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:32:49,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:32:49,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:32:49,390 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:32:49,390 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:32:49,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:32:49,390 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:32:49,390 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_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8 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-12-13 12:32:49,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:32:49,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:32:49,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:32:49,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:32:49,592 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:32:49,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 12:32:52,196 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:32:52,427 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:32:52,428 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 12:32:52,441 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/data/fd14ac248/c13f6fafafbf448bb880fd2ace6822ff/FLAG4a0aedefb [2022-12-13 12:32:52,453 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/data/fd14ac248/c13f6fafafbf448bb880fd2ace6822ff [2022-12-13 12:32:52,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:32:52,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:32:52,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:32:52,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:32:52,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:32:52,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:52,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be8cc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52, skipping insertion in model container [2022-12-13 12:32:52,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:52,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:32:52,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:32:52,666 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_3d13db22-518b-44a1-98d2-a80b4e51ae35/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 12:32:52,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:32:52,863 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:32:52,874 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_3d13db22-518b-44a1-98d2-a80b4e51ae35/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 12:32:52,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:32:52,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:32:52,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:32:52,948 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:32:52,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52 WrapperNode [2022-12-13 12:32:52,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:32:52,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:32:52,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:32:52,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:32:52,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:52,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:52,997 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 12:32:52,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:32:52,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:32:52,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:32:52,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:32:53,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,015 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:32:53,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:32:53,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:32:53,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:32:53,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (1/1) ... [2022-12-13 12:32:53,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:32:53,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:32:53,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:32:53,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:32:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:32:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:32:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:32:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:32:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:32:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:32:53,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:32:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:32:53,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:32:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:32:53,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:32:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:32:53,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:32:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:32:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:32:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:32:53,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:32:53,079 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 12:32:53,184 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:32:53,185 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:32:53,458 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:32:53,561 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:32:53,561 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:32:53,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:32:53 BoogieIcfgContainer [2022-12-13 12:32:53,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:32:53,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:32:53,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:32:53,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:32:53,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:32:52" (1/3) ... [2022-12-13 12:32:53,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ad56f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:32:53, skipping insertion in model container [2022-12-13 12:32:53,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:32:52" (2/3) ... [2022-12-13 12:32:53,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ad56f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:32:53, skipping insertion in model container [2022-12-13 12:32:53,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:32:53" (3/3) ... [2022-12-13 12:32:53,569 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 12:32:53,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:32:53,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 12:32:53,583 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:32:53,629 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:32:53,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-12-13 12:32:53,695 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-13 12:32:53,695 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:32:53,699 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 105 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-12-13 12:32:53,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-12-13 12:32:53,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-12-13 12:32:53,705 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:32:53,712 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-13 12:32:53,714 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-13 12:32:53,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-12-13 12:32:53,736 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-13 12:32:53,736 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:32:53,737 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 105 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-12-13 12:32:53,738 INFO L119 LiptonReduction]: Number of co-enabled transitions 3922 [2022-12-13 12:32:56,875 INFO L134 LiptonReduction]: Checked pairs total: 11567 [2022-12-13 12:32:56,875 INFO L136 LiptonReduction]: Total number of compositions: 147 [2022-12-13 12:32:56,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:32:56,889 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;@48739406, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:32:56,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 12:32:56,890 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:32:56,890 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:32:56,890 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:32:56,891 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:32:56,891 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-12-13 12:32:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:32:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 636, now seen corresponding path program 1 times [2022-12-13 12:32:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:32:56,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078582197] [2022-12-13 12:32:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:32:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:32:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:32:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:32:56,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:32:56,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078582197] [2022-12-13 12:32:56,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078582197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:32:56,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:32:56,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:32:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099132865] [2022-12-13 12:32:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:32:56,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:32:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:32:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:32:57,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:32:57,003 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 298 [2022-12-13 12:32:57,005 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-12-13 12:32:57,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:32:57,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 298 [2022-12-13 12:32:57,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:32:58,236 INFO L130 PetriNetUnfolder]: 8719/11807 cut-off events. [2022-12-13 12:32:58,236 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 12:32:58,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23755 conditions, 11807 events. 8719/11807 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 63056 event pairs, 8719 based on Foata normal form. 0/10299 useless extension candidates. Maximal degree in co-relation 23743. Up to 11731 conditions per place. [2022-12-13 12:32:58,288 INFO L137 encePairwiseOnDemand]: 289/298 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2022-12-13 12:32:58,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2022-12-13 12:32:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:32:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:32:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2022-12-13 12:32:58,314 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5184563758389261 [2022-12-13 12:32:58,314 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2022-12-13 12:32:58,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2022-12-13 12:32:58,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:32:58,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2022-12-13 12:32:58,322 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-12-13 12:32:58,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:32:58,328 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:32:58,330 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 309 transitions. [2022-12-13 12:32:58,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2022-12-13 12:32:58,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:32:58,339 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2022-12-13 12:32:58,341 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, 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-12-13 12:32:58,344 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-12-13 12:32:58,345 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2022-12-13 12:32:58,345 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-12-13 12:32:58,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:32:58,345 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:32:58,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:32:58,346 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 12:32:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:32:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash 624901, now seen corresponding path program 1 times [2022-12-13 12:32:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:32:58,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480138278] [2022-12-13 12:32:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:32:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:32:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:32:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:32:58,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:32:58,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480138278] [2022-12-13 12:32:58,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480138278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:32:58,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:32:58,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:32:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725345625] [2022-12-13 12:32:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:32:58,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:32:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:32:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:32:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:32:58,531 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 298 [2022-12-13 12:32:58,531 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-12-13 12:32:58,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:32:58,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 298 [2022-12-13 12:32:58,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:32:59,521 INFO L130 PetriNetUnfolder]: 6855/9882 cut-off events. [2022-12-13 12:32:59,521 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:32:59,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19319 conditions, 9882 events. 6855/9882 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 62124 event pairs, 1263 based on Foata normal form. 0/9220 useless extension candidates. Maximal degree in co-relation 19316. Up to 7399 conditions per place. [2022-12-13 12:32:59,566 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2022-12-13 12:32:59,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2022-12-13 12:32:59,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:32:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:32:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-12-13 12:32:59,569 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5089485458612976 [2022-12-13 12:32:59,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2022-12-13 12:32:59,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2022-12-13 12:32:59,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:32:59,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2022-12-13 12:32:59,572 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-12-13 12:32:59,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:32:59,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:32:59,576 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 455 transitions. [2022-12-13 12:32:59,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2022-12-13 12:32:59,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:32:59,577 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2022-12-13 12:32:59,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, 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-12-13 12:32:59,578 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 12:32:59,579 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2022-12-13 12:32:59,579 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-12-13 12:32:59,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:32:59,579 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:32:59,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:32:59,580 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-12-13 12:32:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:32:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 341244379, now seen corresponding path program 1 times [2022-12-13 12:32:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:32:59,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308076166] [2022-12-13 12:32:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:32:59,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:32:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:32:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:32:59,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:32:59,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308076166] [2022-12-13 12:32:59,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308076166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:32:59,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:32:59,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:32:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138730740] [2022-12-13 12:32:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:32:59,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:32:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:32:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:32:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:32:59,863 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 298 [2022-12-13 12:32:59,864 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-12-13 12:32:59,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:32:59,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 298 [2022-12-13 12:32:59,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:02,868 INFO L130 PetriNetUnfolder]: 31461/42137 cut-off events. [2022-12-13 12:33:02,868 INFO L131 PetriNetUnfolder]: For 1948/1948 co-relation queries the response was YES. [2022-12-13 12:33:02,915 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 1274. Compared 232360 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-12-13 12:33:03,043 INFO L137 encePairwiseOnDemand]: 287/298 looper letters, 47 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2022-12-13 12:33:03,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 246 flow [2022-12-13 12:33:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:33:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:33:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-12-13 12:33:03,045 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47762863534675615 [2022-12-13 12:33:03,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2022-12-13 12:33:03,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2022-12-13 12:33:03,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:03,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2022-12-13 12:33:03,046 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-12-13 12:33:03,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:03,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:03,049 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 427 transitions. [2022-12-13 12:33:03,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 246 flow [2022-12-13 12:33:03,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:33:03,050 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2022-12-13 12:33:03,051 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, 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-12-13 12:33:03,051 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2022-12-13 12:33:03,051 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2022-12-13 12:33:03,052 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-12-13 12:33:03,052 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:03,052 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:03,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:33:03,052 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-12-13 12:33:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:03,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1988639419, now seen corresponding path program 1 times [2022-12-13 12:33:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:03,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598795681] [2022-12-13 12:33:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:03,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:03,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598795681] [2022-12-13 12:33:03,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598795681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:03,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:03,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:33:03,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977291654] [2022-12-13 12:33:03,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:03,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:33:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:33:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:33:03,218 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 298 [2022-12-13 12:33:03,220 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-12-13 12:33:03,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:03,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 298 [2022-12-13 12:33:03,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:06,369 INFO L130 PetriNetUnfolder]: 29980/40150 cut-off events. [2022-12-13 12:33:06,369 INFO L131 PetriNetUnfolder]: For 19331/19331 co-relation queries the response was YES. [2022-12-13 12:33:06,425 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 1186. Compared 221259 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-12-13 12:33:06,581 INFO L137 encePairwiseOnDemand]: 288/298 looper letters, 74 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2022-12-13 12:33:06,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 448 flow [2022-12-13 12:33:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:33:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:33:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2022-12-13 12:33:06,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4773489932885906 [2022-12-13 12:33:06,583 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2022-12-13 12:33:06,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2022-12-13 12:33:06,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:06,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2022-12-13 12:33:06,584 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-12-13 12:33:06,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:06,586 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:06,586 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 569 transitions. [2022-12-13 12:33:06,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 84 transitions, 448 flow [2022-12-13 12:33:06,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:33:06,672 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 206 flow [2022-12-13 12:33:06,672 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, 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-12-13 12:33:06,672 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2022-12-13 12:33:06,673 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 206 flow [2022-12-13 12:33:06,673 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-12-13 12:33:06,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:06,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:06,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:33:06,673 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-12-13 12:33:06,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1988641985, now seen corresponding path program 1 times [2022-12-13 12:33:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:06,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781276560] [2022-12-13 12:33:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:07,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-12-13 12:33:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:07,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781276560] [2022-12-13 12:33:07,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781276560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:07,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:07,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:33:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200449140] [2022-12-13 12:33:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:07,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:33:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:07,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:33:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:33:07,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 298 [2022-12-13 12:33:07,299 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-12-13 12:33:07,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:07,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 298 [2022-12-13 12:33:07,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:10,269 INFO L130 PetriNetUnfolder]: 18143/25660 cut-off events. [2022-12-13 12:33:10,269 INFO L131 PetriNetUnfolder]: For 15711/17470 co-relation queries the response was YES. [2022-12-13 12:33:10,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66373 conditions, 25660 events. 18143/25660 cut-off events. For 15711/17470 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 160337 event pairs, 4022 based on Foata normal form. 1776/26401 useless extension candidates. Maximal degree in co-relation 66366. Up to 16383 conditions per place. [2022-12-13 12:33:10,405 INFO L137 encePairwiseOnDemand]: 292/298 looper letters, 43 selfloop transitions, 4 changer transitions 21/81 dead transitions. [2022-12-13 12:33:10,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 444 flow [2022-12-13 12:33:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:33:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:33:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2022-12-13 12:33:10,408 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4199424736337488 [2022-12-13 12:33:10,408 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2022-12-13 12:33:10,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2022-12-13 12:33:10,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:10,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2022-12-13 12:33:10,410 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-12-13 12:33:10,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:10,414 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:10,414 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 206 flow. Second operand 7 states and 876 transitions. [2022-12-13 12:33:10,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 444 flow [2022-12-13 12:33:10,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:33:10,550 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 191 flow [2022-12-13 12:33:10,550 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, 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-12-13 12:33:10,551 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2022-12-13 12:33:10,551 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 191 flow [2022-12-13 12:33:10,551 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-12-13 12:33:10,551 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:10,551 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:10,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:33:10,552 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-12-13 12:33:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1192540627, now seen corresponding path program 1 times [2022-12-13 12:33:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:10,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465293448] [2022-12-13 12:33:10,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:10,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:10,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:10,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465293448] [2022-12-13 12:33:10,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465293448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:10,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:10,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:33:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060704846] [2022-12-13 12:33:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:10,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:33:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:33:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:33:10,659 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 298 [2022-12-13 12:33:10,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:10,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:10,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 298 [2022-12-13 12:33:10,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:11,751 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][6], [P0Thread1of1ForFork2InUse, 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|))), 117#L826true, Black: 172#true, 140#L887true, 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), 96#L789true, 76#L773true, Black: 178#true, 68#P2EXITtrue, 196#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:11,752 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:11,752 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:11,752 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:11,752 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:11,752 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([446] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][48], [P0Thread1of1ForFork2InUse, 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|))), 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))), 106#L766true, 140#L887true, 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), 96#L789true, 58#L829true, 68#P2EXITtrue, P3Thread1of1ForFork1InUse, 178#true, P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:11,752 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:11,752 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:11,752 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:11,752 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:12,222 INFO L130 PetriNetUnfolder]: 13304/18815 cut-off events. [2022-12-13 12:33:12,223 INFO L131 PetriNetUnfolder]: For 10200/10618 co-relation queries the response was YES. [2022-12-13 12:33:12,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46898 conditions, 18815 events. 13304/18815 cut-off events. For 10200/10618 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 109739 event pairs, 4350 based on Foata normal form. 266/18390 useless extension candidates. Maximal degree in co-relation 46890. Up to 12385 conditions per place. [2022-12-13 12:33:12,315 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 40 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2022-12-13 12:33:12,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 307 flow [2022-12-13 12:33:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:33:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:33:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-12-13 12:33:12,317 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49105145413870244 [2022-12-13 12:33:12,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2022-12-13 12:33:12,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2022-12-13 12:33:12,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:12,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2022-12-13 12:33:12,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:12,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:12,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:12,320 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 191 flow. Second operand 3 states and 439 transitions. [2022-12-13 12:33:12,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 307 flow [2022-12-13 12:33:12,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 300 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:33:12,522 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 198 flow [2022-12-13 12:33:12,522 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=3, PETRI_FLOW=198, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-13 12:33:12,522 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2022-12-13 12:33:12,522 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 198 flow [2022-12-13 12:33:12,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:12,522 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:12,523 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:12,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:33:12,523 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-12-13 12:33:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash -900948301, now seen corresponding path program 1 times [2022-12-13 12:33:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:12,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413432546] [2022-12-13 12:33:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:12,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:12,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413432546] [2022-12-13 12:33:12,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413432546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:12,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:12,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:33:12,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792005443] [2022-12-13 12:33:12,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:12,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:33:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:12,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:33:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:33:12,626 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 298 [2022-12-13 12:33:12,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 198 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-12-13 12:33:12,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:12,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 298 [2022-12-13 12:33:12,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:13,459 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][89], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 79#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|))), 117#L826true, 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), 96#L789true, Black: 178#true, 76#L773true, 68#P2EXITtrue, 196#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:13,459 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:33:13,459 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:13,459 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:13,459 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:13,631 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][89], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#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|))), Black: 172#true, 194#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), 96#L789true, Black: 178#true, 76#L773true, 58#L829true, 68#P2EXITtrue, P3Thread1of1ForFork1InUse, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:13,631 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,631 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,631 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,631 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,632 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][100], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#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|))), 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))), 106#L766true, 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), 96#L789true, 68#P2EXITtrue, P3Thread1of1ForFork1InUse, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, 178#true]) [2022-12-13 12:33:13,632 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,632 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,632 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,632 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,633 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], [P0Thread1of1ForFork2InUse, 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|))), 117#L826true, Black: 172#true, 140#L887true, 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))), 199#true, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 96#L789true, 76#L773true, Black: 178#true, 196#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 68#P2EXITtrue, P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:13,633 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,633 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,633 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,633 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:13,756 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], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 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|))), Black: 172#true, 140#L887true, 194#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))), 199#true, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 96#L789true, Black: 178#true, 76#L773true, 58#L829true, P3Thread1of1ForFork1InUse, 68#P2EXITtrue, P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:13,756 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:33:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:33:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:33:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:33:13,756 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][94], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, 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|))), 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))), 106#L766true, 140#L887true, 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))), 199#true, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 96#L789true, P3Thread1of1ForFork1InUse, 68#P2EXITtrue, P2Thread1of1ForFork3InUse, 178#true]) [2022-12-13 12:33:13,756 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:33:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:33:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:33:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:33:14,052 INFO L130 PetriNetUnfolder]: 10459/15543 cut-off events. [2022-12-13 12:33:14,053 INFO L131 PetriNetUnfolder]: For 7320/8412 co-relation queries the response was YES. [2022-12-13 12:33:14,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38099 conditions, 15543 events. 10459/15543 cut-off events. For 7320/8412 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 101192 event pairs, 1765 based on Foata normal form. 1259/16141 useless extension candidates. Maximal degree in co-relation 38090. Up to 9168 conditions per place. [2022-12-13 12:33:14,113 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 80 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2022-12-13 12:33:14,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 103 transitions, 591 flow [2022-12-13 12:33:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:33:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:33:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2022-12-13 12:33:14,116 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48456375838926175 [2022-12-13 12:33:14,116 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2022-12-13 12:33:14,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2022-12-13 12:33:14,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:14,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2022-12-13 12:33:14,119 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-12-13 12:33:14,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:14,122 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:14,122 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 198 flow. Second operand 5 states and 722 transitions. [2022-12-13 12:33:14,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 103 transitions, 591 flow [2022-12-13 12:33:14,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 103 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:33:14,170 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 265 flow [2022-12-13 12:33:14,170 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-13 12:33:14,171 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2022-12-13 12:33:14,171 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 265 flow [2022-12-13 12:33:14,171 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-12-13 12:33:14,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:14,171 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-12-13 12:33:14,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:33:14,171 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-12-13 12:33:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1763974616, now seen corresponding path program 1 times [2022-12-13 12:33:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:14,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065816182] [2022-12-13 12:33:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:14,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065816182] [2022-12-13 12:33:14,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065816182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:14,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:14,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:33:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146634304] [2022-12-13 12:33:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:14,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:33:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:14,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:33:14,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:33:14,354 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 298 [2022-12-13 12:33:14,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 265 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-12-13 12:33:14,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:14,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 298 [2022-12-13 12:33:14,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:15,176 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][92], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 79#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|))), 117#L826true, Black: 201#(= ~__unbuffered_cnt~0 0), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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))), 96#L789true, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 76#L773true, Black: 178#true, P3Thread1of1ForFork1InUse, 68#P2EXITtrue, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:15,176 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:33:15,176 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:15,176 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:15,176 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:15,177 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][92], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 79#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|))), 117#L826true, Black: 201#(= ~__unbuffered_cnt~0 0), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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))), 199#true, 96#L789true, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 76#L773true, Black: 178#true, 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:15,177 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:33:15,177 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:15,177 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:15,177 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:15,310 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][92], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#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|))), Black: 201#(= ~__unbuffered_cnt~0 0), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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), 96#L789true, Black: 178#true, 76#L773true, 58#L829true, 68#P2EXITtrue, P3Thread1of1ForFork1InUse, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:15,311 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,311 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,311 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,311 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,311 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][109], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#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|))), Black: 201#(= ~__unbuffered_cnt~0 0), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |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))), 106#L766true, 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), 96#L789true, 68#P2EXITtrue, P3Thread1of1ForFork1InUse, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 178#true, P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:15,311 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,311 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,311 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,311 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,312 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][92], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#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|))), Black: 201#(= ~__unbuffered_cnt~0 0), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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))), 199#true, 165#true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 96#L789true, 76#L773true, Black: 178#true, 58#L829true, 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:15,312 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,312 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,312 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,312 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,312 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][109], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#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|))), Black: 201#(= ~__unbuffered_cnt~0 0), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |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))), 106#L766true, 199#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), 96#L789true, 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 178#true]) [2022-12-13 12:33:15,312 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,312 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,312 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,312 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:15,648 INFO L130 PetriNetUnfolder]: 8509/12992 cut-off events. [2022-12-13 12:33:15,648 INFO L131 PetriNetUnfolder]: For 10293/11055 co-relation queries the response was YES. [2022-12-13 12:33:15,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39835 conditions, 12992 events. 8509/12992 cut-off events. For 10293/11055 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 86506 event pairs, 1002 based on Foata normal form. 813/13256 useless extension candidates. Maximal degree in co-relation 39823. Up to 3794 conditions per place. [2022-12-13 12:33:15,709 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 112 selfloop transitions, 19 changer transitions 0/144 dead transitions. [2022-12-13 12:33:15,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 144 transitions, 915 flow [2022-12-13 12:33:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:33:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:33:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1013 transitions. [2022-12-13 12:33:15,712 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4856184084372004 [2022-12-13 12:33:15,712 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1013 transitions. [2022-12-13 12:33:15,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1013 transitions. [2022-12-13 12:33:15,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:15,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1013 transitions. [2022-12-13 12:33:15,714 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-12-13 12:33:15,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:15,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:15,717 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 265 flow. Second operand 7 states and 1013 transitions. [2022-12-13 12:33:15,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 144 transitions, 915 flow [2022-12-13 12:33:15,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 144 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:33:15,815 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 394 flow [2022-12-13 12:33:15,815 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=394, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2022-12-13 12:33:15,816 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2022-12-13 12:33:15,816 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 394 flow [2022-12-13 12:33:15,816 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-12-13 12:33:15,816 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:15,816 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:15,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:33:15,816 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-12-13 12:33:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash 346938101, now seen corresponding path program 1 times [2022-12-13 12:33:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:15,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338847131] [2022-12-13 12:33:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:15,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:15,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338847131] [2022-12-13 12:33:15,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338847131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:15,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:15,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:33:15,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831345371] [2022-12-13 12:33:15,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:15,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:33:15,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:15,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:33:15,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:33:15,931 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2022-12-13 12:33:15,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 394 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:15,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:15,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2022-12-13 12:33:15,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:17,848 INFO L130 PetriNetUnfolder]: 13468/20248 cut-off events. [2022-12-13 12:33:17,848 INFO L131 PetriNetUnfolder]: For 43133/44221 co-relation queries the response was YES. [2022-12-13 12:33:17,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73650 conditions, 20248 events. 13468/20248 cut-off events. For 43133/44221 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 137292 event pairs, 2433 based on Foata normal form. 357/19944 useless extension candidates. Maximal degree in co-relation 73635. Up to 9993 conditions per place. [2022-12-13 12:33:17,950 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 92 selfloop transitions, 3 changer transitions 25/131 dead transitions. [2022-12-13 12:33:17,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 131 transitions, 1133 flow [2022-12-13 12:33:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:33:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:33:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions. [2022-12-13 12:33:17,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49077181208053694 [2022-12-13 12:33:17,952 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 585 transitions. [2022-12-13 12:33:17,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions. [2022-12-13 12:33:17,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:17,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions. [2022-12-13 12:33:17,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:17,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:17,955 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:17,955 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 394 flow. Second operand 4 states and 585 transitions. [2022-12-13 12:33:17,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 131 transitions, 1133 flow [2022-12-13 12:33:18,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 131 transitions, 998 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-12-13 12:33:18,864 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 373 flow [2022-12-13 12:33:18,864 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=373, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2022-12-13 12:33:18,865 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2022-12-13 12:33:18,865 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 373 flow [2022-12-13 12:33:18,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:18,865 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:18,865 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] [2022-12-13 12:33:18,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:33:18,865 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-12-13 12:33:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1859648906, now seen corresponding path program 1 times [2022-12-13 12:33:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:18,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017551751] [2022-12-13 12:33:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:19,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017551751] [2022-12-13 12:33:19,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017551751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:19,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:19,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:33:19,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436144802] [2022-12-13 12:33:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:19,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:33:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:33:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:33:19,014 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 298 [2022-12-13 12:33:19,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:19,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:19,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 298 [2022-12-13 12:33:19,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:20,102 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][94], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 224#(= ~y~0 1), 79#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|))), 117#L826true, 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#true, 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 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))), 241#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 165#true, 96#L789true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, 76#L773true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:20,102 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:33:20,102 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:20,102 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:20,102 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:20,103 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][94], [P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 224#(= ~y~0 1), 79#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|))), 117#L826true, 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#true, 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 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))), 241#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 165#true, 96#L789true, Black: 180#(= ~__unbuffered_p1_EAX~0 0), 76#L773true, Black: 178#true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse]) [2022-12-13 12:33:20,103 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:33:20,103 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:20,103 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:20,103 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:20,296 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][94], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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, 96#L789true, 58#L829true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#true, 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 241#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 76#L773true, Black: 178#true]) [2022-12-13 12:33:20,297 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,297 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,297 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,297 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,297 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][111], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 106#L766true, 165#true, 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |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))), 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 241#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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-12-13 12:33:20,297 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,297 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,297 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,297 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,298 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][94], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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, 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 58#L829true, Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#true, 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 241#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, 76#L773true]) [2022-12-13 12:33:20,298 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,298 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,298 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,298 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,298 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][111], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 106#L766true, 165#true, 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |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))), 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), 241#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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-12-13 12:33:20,298 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,298 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,298 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,298 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:20,846 INFO L130 PetriNetUnfolder]: 11124/16939 cut-off events. [2022-12-13 12:33:20,846 INFO L131 PetriNetUnfolder]: For 23929/25344 co-relation queries the response was YES. [2022-12-13 12:33:20,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55598 conditions, 16939 events. 11124/16939 cut-off events. For 23929/25344 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 117795 event pairs, 1126 based on Foata normal form. 648/16847 useless extension candidates. Maximal degree in co-relation 55581. Up to 4214 conditions per place. [2022-12-13 12:33:20,931 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 122 selfloop transitions, 28 changer transitions 16/181 dead transitions. [2022-12-13 12:33:20,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 181 transitions, 1259 flow [2022-12-13 12:33:20,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:33:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:33:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1302 transitions. [2022-12-13 12:33:20,934 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4854586129753915 [2022-12-13 12:33:20,934 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1302 transitions. [2022-12-13 12:33:20,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1302 transitions. [2022-12-13 12:33:20,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:20,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1302 transitions. [2022-12-13 12:33:20,936 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-12-13 12:33:20,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:20,939 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:20,939 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 373 flow. Second operand 9 states and 1302 transitions. [2022-12-13 12:33:20,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 181 transitions, 1259 flow [2022-12-13 12:33:21,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 181 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:33:21,955 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 550 flow [2022-12-13 12:33:21,955 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=550, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2022-12-13 12:33:21,955 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2022-12-13 12:33:21,955 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 550 flow [2022-12-13 12:33:21,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:21,956 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:21,956 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] [2022-12-13 12:33:21,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:33:21,956 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-12-13 12:33:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:21,956 INFO L85 PathProgramCache]: Analyzing trace with hash -275542775, now seen corresponding path program 1 times [2022-12-13 12:33:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:21,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124944345] [2022-12-13 12:33:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:22,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:22,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124944345] [2022-12-13 12:33:22,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124944345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:22,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:22,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:33:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737701174] [2022-12-13 12:33:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:22,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:33:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:33:22,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:33:22,064 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 298 [2022-12-13 12:33:22,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:22,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:22,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 298 [2022-12-13 12:33:22,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:24,748 INFO L130 PetriNetUnfolder]: 17721/27317 cut-off events. [2022-12-13 12:33:24,748 INFO L131 PetriNetUnfolder]: For 70246/71453 co-relation queries the response was YES. [2022-12-13 12:33:24,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104118 conditions, 27317 events. 17721/27317 cut-off events. For 70246/71453 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 202688 event pairs, 6586 based on Foata normal form. 576/27038 useless extension candidates. Maximal degree in co-relation 104098. Up to 13121 conditions per place. [2022-12-13 12:33:24,841 INFO L137 encePairwiseOnDemand]: 295/298 looper letters, 86 selfloop transitions, 5 changer transitions 21/123 dead transitions. [2022-12-13 12:33:24,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 123 transitions, 1187 flow [2022-12-13 12:33:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:33:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:33:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2022-12-13 12:33:24,842 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49776286353467564 [2022-12-13 12:33:24,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2022-12-13 12:33:24,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2022-12-13 12:33:24,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:24,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2022-12-13 12:33:24,843 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-12-13 12:33:24,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:24,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:24,844 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 550 flow. Second operand 3 states and 445 transitions. [2022-12-13 12:33:24,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 123 transitions, 1187 flow [2022-12-13 12:33:28,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 123 transitions, 994 flow, removed 68 selfloop flow, removed 4 redundant places. [2022-12-13 12:33:28,305 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 456 flow [2022-12-13 12:33:28,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2022-12-13 12:33:28,306 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2022-12-13 12:33:28,306 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 456 flow [2022-12-13 12:33:28,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:28,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:28,306 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] [2022-12-13 12:33:28,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:33:28,306 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-12-13 12:33:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:28,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1314565413, now seen corresponding path program 2 times [2022-12-13 12:33:28,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:28,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949287525] [2022-12-13 12:33:28,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:28,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:28,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:28,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949287525] [2022-12-13 12:33:28,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949287525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:28,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:28,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:33:28,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870119893] [2022-12-13 12:33:28,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:28,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:33:28,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:28,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:33:28,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:33:28,465 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 298 [2022-12-13 12:33:28,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 456 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-12-13 12:33:28,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:28,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 298 [2022-12-13 12:33:28,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:29,884 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], [79#L2true, 263#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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, 250#(= ~x~0 1), 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork1InUse, 68#P2EXITtrue, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 224#(= ~y~0 1), 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|))), 117#L826true, 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#true, 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 236#(<= ~__unbuffered_cnt~0 2), Black: 243#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, 76#L773true]) [2022-12-13 12:33:29,884 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:33:29,884 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:29,885 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:29,885 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:29,886 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], [79#L2true, 263#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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, 250#(= ~x~0 1), 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 224#(= ~y~0 1), 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|))), 117#L826true, 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#true, 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 236#(<= ~__unbuffered_cnt~0 2), Black: 243#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 76#L773true, Black: 178#true]) [2022-12-13 12:33:29,886 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:33:29,886 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:29,886 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:29,886 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:33:30,154 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], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, 263#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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, 250#(= ~x~0 1), 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 58#L829true, Black: 212#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork1InUse, 68#P2EXITtrue, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#true, 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 236#(<= ~__unbuffered_cnt~0 2), Black: 243#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(= ~__unbuffered_p1_EAX~0 0), Black: 178#true, 76#L773true]) [2022-12-13 12:33:30,154 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,154 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,154 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,154 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,154 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][117], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, 263#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 106#L766true, 165#true, 250#(= ~x~0 1), 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork1InUse, 68#P2EXITtrue, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |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))), 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 236#(<= ~__unbuffered_cnt~0 2), Black: 243#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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-12-13 12:33:30,154 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,154 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,155 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,155 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,155 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][94], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, 263#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 106#L766true, 165#true, 250#(= ~x~0 1), 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork1InUse, 68#P2EXITtrue, 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |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))), 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 236#(<= ~__unbuffered_cnt~0 2), Black: 243#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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-12-13 12:33:30,155 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,155 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,155 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,155 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,156 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], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, 263#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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, 250#(= ~x~0 1), 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 58#L829true, Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#true, 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 236#(<= ~__unbuffered_cnt~0 2), Black: 243#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 76#L773true, Black: 178#true]) [2022-12-13 12:33:30,156 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,156 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][117], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, 263#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 106#L766true, 165#true, 250#(= ~x~0 1), 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |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))), 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 236#(<= ~__unbuffered_cnt~0 2), Black: 243#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 178#true]) [2022-12-13 12:33:30,156 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,156 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,157 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][94], [Black: 196#(= ~__unbuffered_p3_EAX~0 0), 79#L2true, 263#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(= ~__unbuffered_cnt~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 106#L766true, 165#true, 250#(= ~x~0 1), 96#L789true, Black: 213#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(<= ~__unbuffered_cnt~0 1), 68#P2EXITtrue, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 99#L845true, Black: 224#(= ~y~0 1), 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|))), 217#(and (<= ~__unbuffered_cnt~0 1) (= |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))), 227#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 236#(<= ~__unbuffered_cnt~0 2), Black: 243#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 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: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(= ~__unbuffered_p1_EAX~0 0), 178#true]) [2022-12-13 12:33:30,157 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,157 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,157 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:30,157 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:33:31,013 INFO L130 PetriNetUnfolder]: 14817/22809 cut-off events. [2022-12-13 12:33:31,013 INFO L131 PetriNetUnfolder]: For 31058/33216 co-relation queries the response was YES. [2022-12-13 12:33:31,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76499 conditions, 22809 events. 14817/22809 cut-off events. For 31058/33216 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 169688 event pairs, 1447 based on Foata normal form. 662/22644 useless extension candidates. Maximal degree in co-relation 76477. Up to 4884 conditions per place. [2022-12-13 12:33:31,118 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 85 selfloop transitions, 23 changer transitions 75/191 dead transitions. [2022-12-13 12:33:31,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 191 transitions, 1389 flow [2022-12-13 12:33:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:33:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:33:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1561 transitions. [2022-12-13 12:33:31,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4762050030506406 [2022-12-13 12:33:31,121 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1561 transitions. [2022-12-13 12:33:31,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1561 transitions. [2022-12-13 12:33:31,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:31,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1561 transitions. [2022-12-13 12:33:31,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 141.9090909090909) internal successors, (1561), 11 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:31,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 298.0) internal successors, (3576), 12 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:31,127 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 298.0) internal successors, (3576), 12 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:31,127 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 456 flow. Second operand 11 states and 1561 transitions. [2022-12-13 12:33:31,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 191 transitions, 1389 flow [2022-12-13 12:33:33,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 191 transitions, 1359 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 12:33:33,887 INFO L231 Difference]: Finished difference. Result has 84 places, 54 transitions, 388 flow [2022-12-13 12:33:33,887 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=388, PETRI_PLACES=84, PETRI_TRANSITIONS=54} [2022-12-13 12:33:33,887 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2022-12-13 12:33:33,887 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 54 transitions, 388 flow [2022-12-13 12:33:33,888 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-12-13 12:33:33,888 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:33,888 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-12-13 12:33:33,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:33:33,888 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-12-13 12:33:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1476195833, now seen corresponding path program 1 times [2022-12-13 12:33:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:33,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769902795] [2022-12-13 12:33:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:34,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769902795] [2022-12-13 12:33:34,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769902795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:34,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:34,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:33:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134947668] [2022-12-13 12:33:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:34,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:33:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:33:34,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:33:34,055 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 298 [2022-12-13 12:33:34,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 54 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:34,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:34,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 298 [2022-12-13 12:33:34,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:34,702 INFO L130 PetriNetUnfolder]: 3725/5821 cut-off events. [2022-12-13 12:33:34,702 INFO L131 PetriNetUnfolder]: For 13355/13355 co-relation queries the response was YES. [2022-12-13 12:33:34,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21422 conditions, 5821 events. 3725/5821 cut-off events. For 13355/13355 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 32624 event pairs, 900 based on Foata normal form. 1/5822 useless extension candidates. Maximal degree in co-relation 21399. Up to 3083 conditions per place. [2022-12-13 12:33:34,719 INFO L137 encePairwiseOnDemand]: 291/298 looper letters, 57 selfloop transitions, 4 changer transitions 41/102 dead transitions. [2022-12-13 12:33:34,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 102 transitions, 948 flow [2022-12-13 12:33:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:33:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:33:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2022-12-13 12:33:34,721 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46308724832214765 [2022-12-13 12:33:34,721 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2022-12-13 12:33:34,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2022-12-13 12:33:34,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:34,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2022-12-13 12:33:34,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:34,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:34,724 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:34,724 INFO L175 Difference]: Start difference. First operand has 84 places, 54 transitions, 388 flow. Second operand 4 states and 552 transitions. [2022-12-13 12:33:34,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 102 transitions, 948 flow [2022-12-13 12:33:34,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 738 flow, removed 51 selfloop flow, removed 14 redundant places. [2022-12-13 12:33:34,820 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 211 flow [2022-12-13 12:33:34,820 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2022-12-13 12:33:34,820 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2022-12-13 12:33:34,821 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 211 flow [2022-12-13 12:33:34,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:34,821 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:34,821 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-12-13 12:33:34,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:33:34,821 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-12-13 12:33:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1670515459, now seen corresponding path program 2 times [2022-12-13 12:33:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:34,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818785758] [2022-12-13 12:33:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:35,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:35,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818785758] [2022-12-13 12:33:35,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818785758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:35,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:35,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:33:35,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615603633] [2022-12-13 12:33:35,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:35,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:33:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:35,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:33:35,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:33:35,514 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 298 [2022-12-13 12:33:35,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:35,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:35,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 298 [2022-12-13 12:33:35,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:35,873 INFO L130 PetriNetUnfolder]: 876/1412 cut-off events. [2022-12-13 12:33:35,873 INFO L131 PetriNetUnfolder]: For 1700/1700 co-relation queries the response was YES. [2022-12-13 12:33:35,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 1412 events. 876/1412 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5852 event pairs, 67 based on Foata normal form. 1/1413 useless extension candidates. Maximal degree in co-relation 4635. Up to 601 conditions per place. [2022-12-13 12:33:35,879 INFO L137 encePairwiseOnDemand]: 289/298 looper letters, 62 selfloop transitions, 7 changer transitions 43/112 dead transitions. [2022-12-13 12:33:35,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 112 transitions, 765 flow [2022-12-13 12:33:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:33:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:33:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1025 transitions. [2022-12-13 12:33:35,881 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4299496644295302 [2022-12-13 12:33:35,881 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1025 transitions. [2022-12-13 12:33:35,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1025 transitions. [2022-12-13 12:33:35,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:35,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1025 transitions. [2022-12-13 12:33:35,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.125) internal successors, (1025), 8 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:35,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:35,888 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:35,888 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 211 flow. Second operand 8 states and 1025 transitions. [2022-12-13 12:33:35,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 112 transitions, 765 flow [2022-12-13 12:33:35,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 702 flow, removed 17 selfloop flow, removed 10 redundant places. [2022-12-13 12:33:35,898 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 197 flow [2022-12-13 12:33:35,899 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=197, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2022-12-13 12:33:35,899 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2022-12-13 12:33:35,899 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 197 flow [2022-12-13 12:33:35,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:35,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:35,900 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-12-13 12:33:35,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:33:35,900 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-12-13 12:33:35,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -87349045, now seen corresponding path program 3 times [2022-12-13 12:33:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:35,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907122410] [2022-12-13 12:33:35,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:33:35,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:33:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:33:36,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:33:36,009 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:33:36,010 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 12:33:36,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 12:33:36,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 12:33:36,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 12:33:36,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 12:33:36,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:33:36,013 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:36,017 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:33:36,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:33:36,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:33:36 BasicIcfg [2022-12-13 12:33:36,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:33:36,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:33:36,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:33:36,064 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:33:36,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:32:53" (3/4) ... [2022-12-13 12:33:36,067 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:33:36,067 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:33:36,067 INFO L158 Benchmark]: Toolchain (without parser) took 43611.03ms. Allocated memory was 144.7MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 102.2MB in the beginning and 920.7MB in the end (delta: -818.5MB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-12-13 12:33:36,067 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 102.8MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:33:36,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.08ms. Allocated memory is still 144.7MB. Free memory was 101.7MB in the beginning and 93.4MB in the end (delta: 8.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 12:33:36,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.81ms. Allocated memory is still 144.7MB. Free memory was 93.4MB in the beginning and 91.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:33:36,068 INFO L158 Benchmark]: Boogie Preprocessor took 21.35ms. Allocated memory is still 144.7MB. Free memory was 91.3MB in the beginning and 89.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:33:36,068 INFO L158 Benchmark]: RCFGBuilder took 544.35ms. Allocated memory is still 144.7MB. Free memory was 89.2MB in the beginning and 112.9MB in the end (delta: -23.8MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2022-12-13 12:33:36,068 INFO L158 Benchmark]: TraceAbstraction took 42498.60ms. Allocated memory was 144.7MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 112.1MB in the beginning and 920.7MB in the end (delta: -808.6MB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-12-13 12:33:36,068 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 3.0GB. Free memory is still 920.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:33:36,070 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.11ms. Allocated memory is still 102.8MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.08ms. Allocated memory is still 144.7MB. Free memory was 101.7MB in the beginning and 93.4MB in the end (delta: 8.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.81ms. Allocated memory is still 144.7MB. Free memory was 93.4MB in the beginning and 91.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.35ms. Allocated memory is still 144.7MB. Free memory was 91.3MB in the beginning and 89.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.35ms. Allocated memory is still 144.7MB. Free memory was 89.2MB in the beginning and 112.9MB in the end (delta: -23.8MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42498.60ms. Allocated memory was 144.7MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 112.1MB in the beginning and 920.7MB in the end (delta: -808.6MB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 3.0GB. Free memory is still 920.7MB. 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: 3.2s, 158 PlacesBefore, 54 PlacesAfterwards, 147 TransitionsBefore, 42 TransitionsAfterwards, 3922 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 11567 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4652, independent: 4391, independent conditional: 0, independent unconditional: 4391, dependent: 261, dependent conditional: 0, dependent unconditional: 261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2074, independent: 2018, independent conditional: 0, independent unconditional: 2018, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4652, independent: 2373, independent conditional: 0, independent unconditional: 2373, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 2074, unknown conditional: 0, unknown unconditional: 2074] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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))=-4, t601={5: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=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-3, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, 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=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=-2, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=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, 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))=-1, t601={5:0}, t602={6:0}, t603={7:0}, t604={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}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [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}, 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}, 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}, 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}, 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] [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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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}, 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}, 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=49, weak$$choice2=0, 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=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=49, weak$$choice2=0, 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=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=49, 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: 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: 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: 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: 42.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 948 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 243 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2074 IncrementalHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 55 mSDtfsCounter, 2074 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=10, InterpolantAutomatonStates: 73, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-12-13 12:33:36,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 12:33:37,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:33:37,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:33:37,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:33:37,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:33:37,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:33:37,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:33:37,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:33:37,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:33:37,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:33:37,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:33:37,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:33:37,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:33:37,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:33:37,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:33:37,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:33:37,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:33:37,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:33:37,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:33:37,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:33:37,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:33:37,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:33:37,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:33:37,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:33:37,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:33:37,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:33:37,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:33:37,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:33:37,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:33:37,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:33:37,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:33:37,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:33:37,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:33:37,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:33:37,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:33:37,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:33:37,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:33:37,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:33:37,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:33:37,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:33:37,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:33:37,785 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 12:33:37,801 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:33:37,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:33:37,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:33:37,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:33:37,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:33:37,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:33:37,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:33:37,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:33:37,802 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:33:37,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:33:37,802 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:33:37,803 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 12:33:37,804 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 12:33:37,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:33:37,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:33:37,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:33:37,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:33:37,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:33:37,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:33:37,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:33:37,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:33:37,804 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 12:33:37,805 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 12:33:37,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:33:37,805 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:33:37,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:33:37,805 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 12:33:37,805 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:33:37,805 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_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8 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-12-13 12:33:38,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:33:38,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:33:38,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:33:38,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:33:38,033 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:33:38,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 12:33:40,588 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:33:40,850 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:33:40,851 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 12:33:40,863 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/data/89c644db1/eb5a6e1557604d178a05447ea373e810/FLAGa12e1ce06 [2022-12-13 12:33:40,876 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/data/89c644db1/eb5a6e1557604d178a05447ea373e810 [2022-12-13 12:33:40,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:33:40,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:33:40,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:33:40,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:33:40,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:33:40,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:33:40" (1/1) ... [2022-12-13 12:33:40,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6947a1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:40, skipping insertion in model container [2022-12-13 12:33:40,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:33:40" (1/1) ... [2022-12-13 12:33:40,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:33:40,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:33:41,030 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_3d13db22-518b-44a1-98d2-a80b4e51ae35/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 12:33:41,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:33:41,184 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:33:41,193 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_3d13db22-518b-44a1-98d2-a80b4e51ae35/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 12:33:41,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:33:41,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:33:41,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:33:41,279 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:33:41,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41 WrapperNode [2022-12-13 12:33:41,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:33:41,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:33:41,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:33:41,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:33:41,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,323 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 12:33:41,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:33:41,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:33:41,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:33:41,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:33:41,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:33:41,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:33:41,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:33:41,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:33:41,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (1/1) ... [2022-12-13 12:33:41,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:33:41,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:33:41,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:33:41,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:33:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:33:41,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:33:41,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:33:41,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:33:41,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:33:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:33:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:33:41,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:33:41,408 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 12:33:41,522 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:33:41,524 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:33:41,877 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:33:41,983 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:33:41,983 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:33:41,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:33:41 BoogieIcfgContainer [2022-12-13 12:33:41,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:33:41,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:33:41,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:33:41,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:33:41,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:33:40" (1/3) ... [2022-12-13 12:33:41,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b80d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:33:41, skipping insertion in model container [2022-12-13 12:33:41,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:41" (2/3) ... [2022-12-13 12:33:41,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b80d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:33:41, skipping insertion in model container [2022-12-13 12:33:41,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:33:41" (3/3) ... [2022-12-13 12:33:41,994 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 12:33:42,011 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:33:42,011 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 12:33:42,011 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:33:42,070 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:33:42,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-12-13 12:33:42,162 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-13 12:33:42,162 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:33:42,169 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 105 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-12-13 12:33:42,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-12-13 12:33:42,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-12-13 12:33:42,177 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:33:42,188 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-13 12:33:42,190 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-13 12:33:42,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2022-12-13 12:33:42,221 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-13 12:33:42,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:33:42,222 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 105 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-12-13 12:33:42,225 INFO L119 LiptonReduction]: Number of co-enabled transitions 3922 [2022-12-13 12:33:48,935 INFO L134 LiptonReduction]: Checked pairs total: 11809 [2022-12-13 12:33:48,936 INFO L136 LiptonReduction]: Total number of compositions: 137 [2022-12-13 12:33:48,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:33:48,950 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;@6d1b714a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:33:48,950 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 12:33:48,952 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 12:33:48,952 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:33:48,952 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:48,952 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:33:48,953 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-12-13 12:33:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 627, now seen corresponding path program 1 times [2022-12-13 12:33:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:48,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914130558] [2022-12-13 12:33:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:48,965 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-12-13 12:33:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:48,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:48,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:49,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 12:33:49,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:49,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:49,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:49,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914130558] [2022-12-13 12:33:49,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914130558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:49,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:49,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:33:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143823756] [2022-12-13 12:33:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:49,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:33:49,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:33:49,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:33:49,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 289 [2022-12-13 12:33:49,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 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-12-13 12:33:49,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:49,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 289 [2022-12-13 12:33:49,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:50,723 INFO L130 PetriNetUnfolder]: 9959/13447 cut-off events. [2022-12-13 12:33:50,723 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 12:33:50,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27035 conditions, 13447 events. 9959/13447 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 72826 event pairs, 9959 based on Foata normal form. 400/11814 useless extension candidates. Maximal degree in co-relation 27023. Up to 13371 conditions per place. [2022-12-13 12:33:50,828 INFO L137 encePairwiseOnDemand]: 280/289 looper letters, 29 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2022-12-13 12:33:50,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 138 flow [2022-12-13 12:33:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:33:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:33:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 312 transitions. [2022-12-13 12:33:50,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5397923875432526 [2022-12-13 12:33:50,839 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 312 transitions. [2022-12-13 12:33:50,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 312 transitions. [2022-12-13 12:33:50,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:50,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 312 transitions. [2022-12-13 12:33:50,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:50,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:50,849 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:50,850 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 2 states and 312 transitions. [2022-12-13 12:33:50,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 138 flow [2022-12-13 12:33:50,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:33:50,857 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2022-12-13 12:33:50,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 12:33:50,861 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2022-12-13 12:33:50,861 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2022-12-13 12:33:50,861 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-12-13 12:33:50,861 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:50,861 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:33:50,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:51,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:51,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 12:33:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 619200, now seen corresponding path program 1 times [2022-12-13 12:33:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:51,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107186229] [2022-12-13 12:33:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:51,067 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-12-13 12:33:51,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:51,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:51,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:51,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:33:51,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:51,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:51,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:51,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107186229] [2022-12-13 12:33:51,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107186229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:51,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:51,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:33:51,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61352570] [2022-12-13 12:33:51,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:51,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:33:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:51,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:33:51,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:33:51,288 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 289 [2022-12-13 12:33:51,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 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-12-13 12:33:51,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:51,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 289 [2022-12-13 12:33:51,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:52,241 INFO L130 PetriNetUnfolder]: 7831/10654 cut-off events. [2022-12-13 12:33:52,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:33:52,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21387 conditions, 10654 events. 7831/10654 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 55785 event pairs, 4023 based on Foata normal form. 0/9663 useless extension candidates. Maximal degree in co-relation 21384. Up to 8431 conditions per place. [2022-12-13 12:33:52,275 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 45 selfloop transitions, 2 changer transitions 4/56 dead transitions. [2022-12-13 12:33:52,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 228 flow [2022-12-13 12:33:52,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:33:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:33:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2022-12-13 12:33:52,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5305651672433679 [2022-12-13 12:33:52,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2022-12-13 12:33:52,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2022-12-13 12:33:52,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:52,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2022-12-13 12:33:52,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:52,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:52,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:52,281 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 460 transitions. [2022-12-13 12:33:52,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 228 flow [2022-12-13 12:33:52,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:33:52,282 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 74 flow [2022-12-13 12:33:52,282 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-12-13 12:33:52,283 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2022-12-13 12:33:52,283 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 74 flow [2022-12-13 12:33:52,283 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-12-13 12:33:52,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:52,283 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:52,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:33:52,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:52,485 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-12-13 12:33:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1433554322, now seen corresponding path program 1 times [2022-12-13 12:33:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:52,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473352794] [2022-12-13 12:33:52,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:52,489 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-12-13 12:33:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:52,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:52,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:52,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:33:52,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:52,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:52,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:52,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473352794] [2022-12-13 12:33:52,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473352794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:52,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:52,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:33:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71332906] [2022-12-13 12:33:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:52,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:33:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:33:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:33:52,622 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 289 [2022-12-13 12:33:52,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 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-12-13 12:33:52,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:52,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 289 [2022-12-13 12:33:52,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:53,282 INFO L130 PetriNetUnfolder]: 3719/5317 cut-off events. [2022-12-13 12:33:53,282 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-12-13 12:33:53,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11102 conditions, 5317 events. 3719/5317 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28205 event pairs, 803 based on Foata normal form. 108/5185 useless extension candidates. Maximal degree in co-relation 11098. Up to 4756 conditions per place. [2022-12-13 12:33:53,304 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 40 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2022-12-13 12:33:53,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 210 flow [2022-12-13 12:33:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:33:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:33:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 12:33:53,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-13 12:33:53,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 12:33:53,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 12:33:53,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:53,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 12:33:53,310 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-12-13 12:33:53,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:53,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:53,314 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 74 flow. Second operand 3 states and 442 transitions. [2022-12-13 12:33:53,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 210 flow [2022-12-13 12:33:53,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:33:53,316 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 103 flow [2022-12-13 12:33:53,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, 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-12-13 12:33:53,316 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2022-12-13 12:33:53,317 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 103 flow [2022-12-13 12:33:53,317 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-12-13 12:33:53,317 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:53,317 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:53,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:33:53,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:53,519 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-12-13 12:33:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1355579488, now seen corresponding path program 1 times [2022-12-13 12:33:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:53,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278470466] [2022-12-13 12:33:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:53,524 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-12-13 12:33:53,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:53,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:53,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:53,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:33:53,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:53,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:53,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:53,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278470466] [2022-12-13 12:33:53,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278470466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:53,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:53,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:33:53,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231057418] [2022-12-13 12:33:53,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:53,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:33:53,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:33:53,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:33:53,645 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 289 [2022-12-13 12:33:53,646 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-12-13 12:33:53,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:53,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 289 [2022-12-13 12:33:53,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:53,989 INFO L130 PetriNetUnfolder]: 1694/2617 cut-off events. [2022-12-13 12:33:53,989 INFO L131 PetriNetUnfolder]: For 319/319 co-relation queries the response was YES. [2022-12-13 12:33:53,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6274 conditions, 2617 events. 1694/2617 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13605 event pairs, 402 based on Foata normal form. 135/2647 useless extension candidates. Maximal degree in co-relation 6269. Up to 1426 conditions per place. [2022-12-13 12:33:53,997 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 53 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2022-12-13 12:33:53,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 309 flow [2022-12-13 12:33:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:33:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:33:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2022-12-13 12:33:53,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5112456747404844 [2022-12-13 12:33:53,999 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2022-12-13 12:33:53,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2022-12-13 12:33:54,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:54,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2022-12-13 12:33:54,001 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-12-13 12:33:54,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:54,003 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:54,003 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 103 flow. Second operand 4 states and 591 transitions. [2022-12-13 12:33:54,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 309 flow [2022-12-13 12:33:54,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:33:54,008 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 150 flow [2022-12-13 12:33:54,008 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, 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-12-13 12:33:54,009 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, -8 predicate places. [2022-12-13 12:33:54,009 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 150 flow [2022-12-13 12:33:54,009 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-12-13 12:33:54,009 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:54,010 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-12-13 12:33:54,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:33:54,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:54,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 12:33:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -895051617, now seen corresponding path program 1 times [2022-12-13 12:33:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:54,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746374998] [2022-12-13 12:33:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:54,212 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-12-13 12:33:54,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:54,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:54,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:54,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:33:54,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:54,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:54,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:54,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746374998] [2022-12-13 12:33:54,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746374998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:54,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:54,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:33:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115646080] [2022-12-13 12:33:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:54,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:33:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:54,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:33:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:33:54,351 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 289 [2022-12-13 12:33:54,352 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-12-13 12:33:54,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:54,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 289 [2022-12-13 12:33:54,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:54,677 INFO L130 PetriNetUnfolder]: 1064/1672 cut-off events. [2022-12-13 12:33:54,677 INFO L131 PetriNetUnfolder]: For 1137/1137 co-relation queries the response was YES. [2022-12-13 12:33:54,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4543 conditions, 1672 events. 1064/1672 cut-off events. For 1137/1137 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8255 event pairs, 331 based on Foata normal form. 63/1693 useless extension candidates. Maximal degree in co-relation 4537. Up to 630 conditions per place. [2022-12-13 12:33:54,684 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 64 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2022-12-13 12:33:54,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 418 flow [2022-12-13 12:33:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:33:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:33:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2022-12-13 12:33:54,687 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.510726643598616 [2022-12-13 12:33:54,687 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2022-12-13 12:33:54,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2022-12-13 12:33:54,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:54,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2022-12-13 12:33:54,689 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-12-13 12:33:54,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:54,692 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:54,692 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 150 flow. Second operand 5 states and 738 transitions. [2022-12-13 12:33:54,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 418 flow [2022-12-13 12:33:54,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 400 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 12:33:54,696 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 200 flow [2022-12-13 12:33:54,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, 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-12-13 12:33:54,697 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2022-12-13 12:33:54,697 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 200 flow [2022-12-13 12:33:54,697 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-12-13 12:33:54,698 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:54,698 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-12-13 12:33:54,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:33:54,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:54,899 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-12-13 12:33:54,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash 403419926, now seen corresponding path program 1 times [2022-12-13 12:33:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:54,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929619599] [2022-12-13 12:33:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:54,901 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-12-13 12:33:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:54,903 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:54,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:55,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 12:33:55,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:55,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-12-13 12:33:55,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:55,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929619599] [2022-12-13 12:33:55,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929619599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:55,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:55,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:33:55,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735996709] [2022-12-13 12:33:55,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:55,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:33:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:33:55,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:33:55,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 289 [2022-12-13 12:33:55,067 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-12-13 12:33:55,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:55,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 289 [2022-12-13 12:33:55,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:55,533 INFO L130 PetriNetUnfolder]: 999/1542 cut-off events. [2022-12-13 12:33:55,534 INFO L131 PetriNetUnfolder]: For 1300/1300 co-relation queries the response was YES. [2022-12-13 12:33:55,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 1542 events. 999/1542 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7586 event pairs, 326 based on Foata normal form. 13/1526 useless extension candidates. Maximal degree in co-relation 4343. Up to 630 conditions per place. [2022-12-13 12:33:55,539 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 60 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2022-12-13 12:33:55,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 444 flow [2022-12-13 12:33:55,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:33:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:33:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2022-12-13 12:33:55,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5017301038062284 [2022-12-13 12:33:55,543 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 870 transitions. [2022-12-13 12:33:55,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 870 transitions. [2022-12-13 12:33:55,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:55,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 870 transitions. [2022-12-13 12:33:55,546 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-12-13 12:33:55,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:55,550 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:55,550 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 200 flow. Second operand 6 states and 870 transitions. [2022-12-13 12:33:55,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 444 flow [2022-12-13 12:33:55,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 410 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 12:33:55,564 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 210 flow [2022-12-13 12:33:55,565 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, 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-12-13 12:33:55,565 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2022-12-13 12:33:55,565 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 210 flow [2022-12-13 12:33:55,566 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-12-13 12:33:55,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:55,566 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-12-13 12:33:55,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:55,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:55,767 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-12-13 12:33:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1380844053, now seen corresponding path program 1 times [2022-12-13 12:33:55,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:55,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489403962] [2022-12-13 12:33:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:55,769 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-12-13 12:33:55,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:55,770 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:55,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:55,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 12:33:55,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:56,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:56,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:56,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489403962] [2022-12-13 12:33:56,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489403962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:56,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:56,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:33:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305755956] [2022-12-13 12:33:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:56,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:33:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:56,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:33:56,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:33:56,262 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 289 [2022-12-13 12:33:56,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 210 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-12-13 12:33:56,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:56,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 289 [2022-12-13 12:33:56,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:56,704 INFO L130 PetriNetUnfolder]: 1159/1791 cut-off events. [2022-12-13 12:33:56,704 INFO L131 PetriNetUnfolder]: For 1909/1909 co-relation queries the response was YES. [2022-12-13 12:33:56,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5314 conditions, 1791 events. 1159/1791 cut-off events. For 1909/1909 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8773 event pairs, 195 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 5306. Up to 773 conditions per place. [2022-12-13 12:33:56,709 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 100 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2022-12-13 12:33:56,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 112 transitions, 788 flow [2022-12-13 12:33:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:33:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:33:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1112 transitions. [2022-12-13 12:33:56,712 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4809688581314879 [2022-12-13 12:33:56,712 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1112 transitions. [2022-12-13 12:33:56,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1112 transitions. [2022-12-13 12:33:56,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:56,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1112 transitions. [2022-12-13 12:33:56,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:56,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:56,719 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:56,719 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 210 flow. Second operand 8 states and 1112 transitions. [2022-12-13 12:33:56,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 112 transitions, 788 flow [2022-12-13 12:33:56,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 660 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-13 12:33:56,731 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 192 flow [2022-12-13 12:33:56,731 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2022-12-13 12:33:56,732 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2022-12-13 12:33:56,732 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 192 flow [2022-12-13 12:33:56,732 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-12-13 12:33:56,732 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:56,732 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-12-13 12:33:56,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:33:56,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:56,934 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-12-13 12:33:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1971748377, now seen corresponding path program 2 times [2022-12-13 12:33:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:56,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012656706] [2022-12-13 12:33:56,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:33:56,937 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-12-13 12:33:56,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:56,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:56,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:57,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 12:33:57,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:33:57,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:33:57,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:57,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:57,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:57,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012656706] [2022-12-13 12:33:57,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012656706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:57,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:57,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:33:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620608878] [2022-12-13 12:33:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:57,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:33:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:57,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:33:57,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:33:57,087 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 289 [2022-12-13 12:33:57,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 192 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-12-13 12:33:57,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:57,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 289 [2022-12-13 12:33:57,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:57,444 INFO L130 PetriNetUnfolder]: 2066/3238 cut-off events. [2022-12-13 12:33:57,444 INFO L131 PetriNetUnfolder]: For 2529/2529 co-relation queries the response was YES. [2022-12-13 12:33:57,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9206 conditions, 3238 events. 2066/3238 cut-off events. For 2529/2529 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18744 event pairs, 858 based on Foata normal form. 1/3173 useless extension candidates. Maximal degree in co-relation 9195. Up to 1777 conditions per place. [2022-12-13 12:33:57,454 INFO L137 encePairwiseOnDemand]: 285/289 looper letters, 75 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2022-12-13 12:33:57,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 514 flow [2022-12-13 12:33:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:33:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:33:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2022-12-13 12:33:57,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5034602076124568 [2022-12-13 12:33:57,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2022-12-13 12:33:57,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2022-12-13 12:33:57,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:57,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2022-12-13 12:33:57,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:57,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:57,458 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:57,458 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 192 flow. Second operand 4 states and 582 transitions. [2022-12-13 12:33:57,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 514 flow [2022-12-13 12:33:57,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 506 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:33:57,488 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 220 flow [2022-12-13 12:33:57,488 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2022-12-13 12:33:57,488 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2022-12-13 12:33:57,488 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 220 flow [2022-12-13 12:33:57,489 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-12-13 12:33:57,489 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:57,489 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-12-13 12:33:57,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:33:57,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:57,690 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 12:33:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash 868127833, now seen corresponding path program 1 times [2022-12-13 12:33:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:57,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350695489] [2022-12-13 12:33:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:57,694 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-12-13 12:33:57,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:57,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:57,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:57,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 12:33:57,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:58,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:33:58,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:33:58,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350695489] [2022-12-13 12:33:58,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350695489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:33:58,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:33:58,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:33:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446501607] [2022-12-13 12:33:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:33:58,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:33:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:33:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:33:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:33:58,888 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 289 [2022-12-13 12:33:58,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 220 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-12-13 12:33:58,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:33:58,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 289 [2022-12-13 12:33:58,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:33:59,479 INFO L130 PetriNetUnfolder]: 1816/2866 cut-off events. [2022-12-13 12:33:59,479 INFO L131 PetriNetUnfolder]: For 2248/2248 co-relation queries the response was YES. [2022-12-13 12:33:59,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8426 conditions, 2866 events. 1816/2866 cut-off events. For 2248/2248 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16251 event pairs, 375 based on Foata normal form. 4/2863 useless extension candidates. Maximal degree in co-relation 8413. Up to 2393 conditions per place. [2022-12-13 12:33:59,486 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 47 selfloop transitions, 4 changer transitions 20/76 dead transitions. [2022-12-13 12:33:59,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 488 flow [2022-12-13 12:33:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:33:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:33:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2022-12-13 12:33:59,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4302191464821223 [2022-12-13 12:33:59,488 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2022-12-13 12:33:59,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2022-12-13 12:33:59,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:33:59,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2022-12-13 12:33:59,489 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-12-13 12:33:59,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:59,491 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:33:59,491 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 220 flow. Second operand 6 states and 746 transitions. [2022-12-13 12:33:59,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 488 flow [2022-12-13 12:33:59,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:33:59,508 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 184 flow [2022-12-13 12:33:59,508 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2022-12-13 12:33:59,508 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2022-12-13 12:33:59,508 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 184 flow [2022-12-13 12:33:59,509 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-12-13 12:33:59,509 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:33:59,509 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-12-13 12:33:59,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:33:59,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:59,710 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-12-13 12:33:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1687660935, now seen corresponding path program 3 times [2022-12-13 12:33:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:33:59,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853594668] [2022-12-13 12:33:59,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:33:59,713 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-12-13 12:33:59,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:33:59,716 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:59,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:33:59,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 12:33:59,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 12:33:59,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:33:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:34:00,030 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 12:34:00,030 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:34:00,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 12:34:00,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 12:34:00,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 12:34:00,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 12:34:00,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 12:34:00,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 12:34:00,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 12:34:00,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 12:34:00,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 12:34:00,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 12:34:00,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 12:34:00,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 12:34:00,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 12:34:00,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 12:34:00,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 12:34:00,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 12:34:00,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:34:00,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/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-12-13 12:34:00,236 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:34:00,243 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:34:00,243 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:34:00,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:34:00 BasicIcfg [2022-12-13 12:34:00,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:34:00,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:34:00,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:34:00,295 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:34:00,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:33:41" (3/4) ... [2022-12-13 12:34:00,297 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:34:00,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:34:00,298 INFO L158 Benchmark]: Toolchain (without parser) took 19417.57ms. Allocated memory was 77.6MB in the beginning and 939.5MB in the end (delta: 861.9MB). Free memory was 54.6MB in the beginning and 642.1MB in the end (delta: -587.5MB). Peak memory consumption was 275.7MB. Max. memory is 16.1GB. [2022-12-13 12:34:00,298 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 77.6MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:34:00,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.80ms. Allocated memory is still 77.6MB. Free memory was 54.6MB in the beginning and 47.4MB in the end (delta: 7.2MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-12-13 12:34:00,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.39ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 44.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:34:00,298 INFO L158 Benchmark]: Boogie Preprocessor took 30.20ms. Allocated memory is still 77.6MB. Free memory was 44.9MB in the beginning and 42.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:34:00,299 INFO L158 Benchmark]: RCFGBuilder took 630.77ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 42.6MB in the beginning and 72.7MB in the end (delta: -30.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-12-13 12:34:00,299 INFO L158 Benchmark]: TraceAbstraction took 18305.99ms. Allocated memory was 100.7MB in the beginning and 939.5MB in the end (delta: 838.9MB). Free memory was 71.8MB in the beginning and 642.1MB in the end (delta: -570.3MB). Peak memory consumption was 267.1MB. Max. memory is 16.1GB. [2022-12-13 12:34:00,299 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 939.5MB. Free memory is still 642.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:34:00,300 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.13ms. Allocated memory is still 77.6MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.80ms. Allocated memory is still 77.6MB. Free memory was 54.6MB in the beginning and 47.4MB in the end (delta: 7.2MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.39ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 44.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.20ms. Allocated memory is still 77.6MB. Free memory was 44.9MB in the beginning and 42.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 630.77ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 42.6MB in the beginning and 72.7MB in the end (delta: -30.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18305.99ms. Allocated memory was 100.7MB in the beginning and 939.5MB in the end (delta: 838.9MB). Free memory was 71.8MB in the beginning and 642.1MB in the end (delta: -570.3MB). Peak memory consumption was 267.1MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 939.5MB. Free memory is still 642.1MB. 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.7s, 159 PlacesBefore, 55 PlacesAfterwards, 148 TransitionsBefore, 43 TransitionsAfterwards, 3922 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 137 TotalNumberOfCompositions, 11809 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4035, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1962, independent: 1922, independent conditional: 0, independent unconditional: 1922, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4035, independent: 1847, independent conditional: 0, independent unconditional: 1847, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 1962, unknown conditional: 0, unknown unconditional: 1962] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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={11: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={11:0}, t602={15: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] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __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={11:0}, t602={15:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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 [\result={0:0}, __unbuffered_cnt=1, __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={11:0}, t602={15:0}, t603={7:0}, t604={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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 [\result={0:0}, __unbuffered_cnt=1, __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 [\result={0:0}, __unbuffered_cnt=1, __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 [\result={0:0}, __unbuffered_cnt=1, __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 [\result={0:0}, __unbuffered_cnt=1, __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 [\result={0:0}, __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}, 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] [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 [\result={0:0}, __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] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 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={11:0}, t602={15:0}, t603={7:0}, t604={-2147483637: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)=1, \old(expression)=0, \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: 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: 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: 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: 18.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 195 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1760 IncrementalHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 17 mSDtfsCounter, 1760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=8, InterpolantAutomatonStates: 41, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 158 ConstructedInterpolants, 15 QuantifiedInterpolants, 1922 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1312 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 12:34:00,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d13db22-518b-44a1-98d2-a80b4e51ae35/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample