./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:12:12,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:12:12,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:12:12,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:12:12,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:12:12,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:12:12,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:12:12,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:12:12,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:12:12,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:12:12,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:12:12,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:12:12,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:12:12,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:12:12,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:12:12,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:12:12,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:12:12,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:12:12,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:12:12,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:12:12,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:12:12,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:12:12,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:12:12,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:12:12,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:12:12,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:12:12,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:12:12,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:12:12,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:12:12,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:12:12,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:12:12,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:12:12,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:12:12,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:12:12,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:12:12,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:12:12,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:12:12,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:12:12,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:12:12,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:12:12,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:12:12,960 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:12:12,983 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:12:12,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:12:12,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:12:12,984 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:12:12,985 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:12:12,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:12:12,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:12:12,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:12:12,986 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:12:12,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:12:12,987 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:12:12,987 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:12:12,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:12:12,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:12:12,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:12:12,988 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:12:12,988 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:12:12,988 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:12:12,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:12:12,988 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:12:12,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:12:12,989 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:12:12,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:12:12,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:12:12,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:12:12,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:12:12,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:12:12,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:12:12,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:12:12,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:12:12,990 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:12:12,991 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:12:12,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:12:12,991 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_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a [2022-11-25 17:12:13,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:12:13,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:12:13,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:12:13,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:12:13,301 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:12:13,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i [2022-11-25 17:12:16,399 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:12:16,664 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:12:16,664 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/sv-benchmarks/c/pthread-wmm/mix028_tso.i [2022-11-25 17:12:16,681 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/data/228cd456a/e3cb30f625224324ad8a7e551b0970a0/FLAGaf55a0020 [2022-11-25 17:12:16,701 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/data/228cd456a/e3cb30f625224324ad8a7e551b0970a0 [2022-11-25 17:12:16,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:12:16,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:12:16,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:12:16,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:12:16,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:12:16,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:16" (1/1) ... [2022-11-25 17:12:16,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6326a39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:16, skipping insertion in model container [2022-11-25 17:12:16,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:16" (1/1) ... [2022-11-25 17:12:16,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:12:16,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:12:16,976 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_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/sv-benchmarks/c/pthread-wmm/mix028_tso.i[944,957] [2022-11-25 17:12:17,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:12:17,335 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:12:17,353 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_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/sv-benchmarks/c/pthread-wmm/mix028_tso.i[944,957] [2022-11-25 17:12:17,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:17,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:17,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:12:17,515 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:12:17,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17 WrapperNode [2022-11-25 17:12:17,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:12:17,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:12:17,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:12:17,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:12:17,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,596 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-11-25 17:12:17,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:12:17,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:12:17,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:12:17,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:12:17,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,633 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:12:17,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:12:17,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:12:17,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:12:17,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (1/1) ... [2022-11-25 17:12:17,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:12:17,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:12:17,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:12:17,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:12:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:12:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:12:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:12:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:12:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:12:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:12:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:12:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:12:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:12:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:12:17,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:12:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:12:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:12:17,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:12:17,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:12:17,747 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:12:17,891 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:12:17,893 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:12:18,335 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:12:18,537 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:12:18,538 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:12:18,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:18 BoogieIcfgContainer [2022-11-25 17:12:18,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:12:18,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:12:18,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:12:18,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:12:18,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:12:16" (1/3) ... [2022-11-25 17:12:18,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b28c2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:12:18, skipping insertion in model container [2022-11-25 17:12:18,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:17" (2/3) ... [2022-11-25 17:12:18,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b28c2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:12:18, skipping insertion in model container [2022-11-25 17:12:18,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:18" (3/3) ... [2022-11-25 17:12:18,551 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2022-11-25 17:12:18,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:12:18,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 17:12:18,573 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:12:18,633 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:12:18,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-25 17:12:18,770 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-25 17:12:18,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:12:18,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:12:18,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-11-25 17:12:18,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-11-25 17:12:18,785 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:12:18,800 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-11-25 17:12:18,803 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-11-25 17:12:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-11-25 17:12:18,836 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-25 17:12:18,837 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:12:18,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:12:18,840 INFO L119 LiptonReduction]: Number of co-enabled transitions 2244 [2022-11-25 17:12:25,632 INFO L134 LiptonReduction]: Checked pairs total: 5858 [2022-11-25 17:12:25,632 INFO L136 LiptonReduction]: Total number of compositions: 122 [2022-11-25 17:12:25,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:12:25,656 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;@5c7702e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:12:25,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 17:12:25,657 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:12:25,658 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:12:25,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:25,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:12:25,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2022-11-25 17:12:25,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:25,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567817668] [2022-11-25 17:12:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:25,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:25,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567817668] [2022-11-25 17:12:25,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567817668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:25,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:25,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:12:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381136689] [2022-11-25 17:12:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:25,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:12:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:25,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:12:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:12:25,836 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 247 [2022-11-25 17:12:25,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:25,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:25,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 247 [2022-11-25 17:12:25,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:26,251 INFO L130 PetriNetUnfolder]: 1101/1661 cut-off events. [2022-11-25 17:12:26,251 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-25 17:12:26,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 1661 events. 1101/1661 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7896 event pairs, 1101 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 3323. Up to 1637 conditions per place. [2022-11-25 17:12:26,267 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-11-25 17:12:26,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2022-11-25 17:12:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:12:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:12:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2022-11-25 17:12:26,282 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5121457489878543 [2022-11-25 17:12:26,283 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2022-11-25 17:12:26,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2022-11-25 17:12:26,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:26,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2022-11-25 17:12:26,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:26,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:26,296 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:26,298 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 253 transitions. [2022-11-25 17:12:26,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2022-11-25 17:12:26,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:12:26,303 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-11-25 17:12:26,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-11-25 17:12:26,308 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-11-25 17:12:26,309 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-11-25 17:12:26,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:26,310 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:26,310 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:26,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:12:26,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1132132050, now seen corresponding path program 1 times [2022-11-25 17:12:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:26,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690918852] [2022-11-25 17:12:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:26,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690918852] [2022-11-25 17:12:26,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690918852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:26,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:26,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:12:26,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56992712] [2022-11-25 17:12:26,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:26,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:12:26,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:26,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:12:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:12:26,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 247 [2022-11-25 17:12:26,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:26,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:26,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 247 [2022-11-25 17:12:26,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:27,054 INFO L130 PetriNetUnfolder]: 910/1452 cut-off events. [2022-11-25 17:12:27,055 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:12:27,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1452 events. 910/1452 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7471 event pairs, 146 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 2845. Up to 1101 conditions per place. [2022-11-25 17:12:27,068 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 28 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2022-11-25 17:12:27,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow [2022-11-25 17:12:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:12:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:12:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-11-25 17:12:27,075 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4939271255060729 [2022-11-25 17:12:27,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-11-25 17:12:27,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-11-25 17:12:27,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:27,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-11-25 17:12:27,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,086 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 366 transitions. [2022-11-25 17:12:27,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow [2022-11-25 17:12:27,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:12:27,088 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-11-25 17:12:27,088 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-11-25 17:12:27,089 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-11-25 17:12:27,089 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-11-25 17:12:27,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,090 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:27,090 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:27,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:12:27,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1352079934, now seen corresponding path program 1 times [2022-11-25 17:12:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:27,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936990288] [2022-11-25 17:12:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936990288] [2022-11-25 17:12:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936990288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:27,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:27,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:12:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638311896] [2022-11-25 17:12:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:27,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:12:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:12:27,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:12:27,389 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 247 [2022-11-25 17:12:27,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:27,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 247 [2022-11-25 17:12:27,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:27,687 INFO L130 PetriNetUnfolder]: 719/1153 cut-off events. [2022-11-25 17:12:27,693 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-11-25 17:12:27,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2336 conditions, 1153 events. 719/1153 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5515 event pairs, 269 based on Foata normal form. 0/1113 useless extension candidates. Maximal degree in co-relation 2332. Up to 691 conditions per place. [2022-11-25 17:12:27,704 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 27 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-11-25 17:12:27,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 132 flow [2022-11-25 17:12:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:12:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:12:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-11-25 17:12:27,707 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4898785425101215 [2022-11-25 17:12:27,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2022-11-25 17:12:27,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2022-11-25 17:12:27,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:27,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2022-11-25 17:12:27,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,712 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 3 states and 363 transitions. [2022-11-25 17:12:27,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 132 flow [2022-11-25 17:12:27,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:12:27,717 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2022-11-25 17:12:27,717 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-11-25 17:12:27,719 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-11-25 17:12:27,719 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 60 flow [2022-11-25 17:12:27,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:27,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:27,720 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:27,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:12:27,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1035195800, now seen corresponding path program 1 times [2022-11-25 17:12:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:27,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495404726] [2022-11-25 17:12:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:28,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:28,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495404726] [2022-11-25 17:12:28,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495404726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:28,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:28,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:12:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039422337] [2022-11-25 17:12:28,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:28,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:12:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:12:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:12:28,545 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 247 [2022-11-25 17:12:28,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 60 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:28,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:28,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 247 [2022-11-25 17:12:28,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:28,910 INFO L130 PetriNetUnfolder]: 586/921 cut-off events. [2022-11-25 17:12:28,910 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-25 17:12:28,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 921 events. 586/921 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4200 event pairs, 124 based on Foata normal form. 60/969 useless extension candidates. Maximal degree in co-relation 1979. Up to 671 conditions per place. [2022-11-25 17:12:28,916 INFO L137 encePairwiseOnDemand]: 242/247 looper letters, 22 selfloop transitions, 3 changer transitions 10/38 dead transitions. [2022-11-25 17:12:28,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 163 flow [2022-11-25 17:12:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:12:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:12:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2022-11-25 17:12:28,919 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41700404858299595 [2022-11-25 17:12:28,919 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 618 transitions. [2022-11-25 17:12:28,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 618 transitions. [2022-11-25 17:12:28,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:28,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 618 transitions. [2022-11-25 17:12:28,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:28,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:28,926 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:28,926 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 60 flow. Second operand 6 states and 618 transitions. [2022-11-25 17:12:28,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 163 flow [2022-11-25 17:12:28,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:12:28,928 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 58 flow [2022-11-25 17:12:28,928 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-11-25 17:12:28,928 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-11-25 17:12:28,929 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 58 flow [2022-11-25 17:12:28,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:28,929 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:28,929 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:28,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:12:28,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1952058056, now seen corresponding path program 1 times [2022-11-25 17:12:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:28,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537300625] [2022-11-25 17:12:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:29,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:29,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537300625] [2022-11-25 17:12:29,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537300625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:29,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:29,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:12:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161211619] [2022-11-25 17:12:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:29,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:12:29,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:29,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:12:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:12:29,820 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 247 [2022-11-25 17:12:29,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:29,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:29,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 247 [2022-11-25 17:12:29,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:30,204 INFO L130 PetriNetUnfolder]: 1031/1672 cut-off events. [2022-11-25 17:12:30,204 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-11-25 17:12:30,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 1672 events. 1031/1672 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8382 event pairs, 75 based on Foata normal form. 40/1712 useless extension candidates. Maximal degree in co-relation 3473. Up to 1173 conditions per place. [2022-11-25 17:12:30,216 INFO L137 encePairwiseOnDemand]: 237/247 looper letters, 36 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2022-11-25 17:12:30,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 220 flow [2022-11-25 17:12:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:12:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:12:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2022-11-25 17:12:30,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4625506072874494 [2022-11-25 17:12:30,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2022-11-25 17:12:30,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2022-11-25 17:12:30,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:30,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2022-11-25 17:12:30,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,223 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,223 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 58 flow. Second operand 4 states and 457 transitions. [2022-11-25 17:12:30,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 220 flow [2022-11-25 17:12:30,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:12:30,225 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 124 flow [2022-11-25 17:12:30,225 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-11-25 17:12:30,226 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-11-25 17:12:30,226 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 124 flow [2022-11-25 17:12:30,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:30,227 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:30,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:12:30,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash 384255968, now seen corresponding path program 1 times [2022-11-25 17:12:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:30,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710530180] [2022-11-25 17:12:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:30,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710530180] [2022-11-25 17:12:30,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710530180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:30,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:30,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:12:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122947265] [2022-11-25 17:12:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:30,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:12:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:30,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:12:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:12:30,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 247 [2022-11-25 17:12:30,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:30,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 247 [2022-11-25 17:12:30,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:30,796 INFO L130 PetriNetUnfolder]: 707/1184 cut-off events. [2022-11-25 17:12:30,796 INFO L131 PetriNetUnfolder]: For 605/641 co-relation queries the response was YES. [2022-11-25 17:12:30,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 1184 events. 707/1184 cut-off events. For 605/641 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6025 event pairs, 121 based on Foata normal form. 167/1333 useless extension candidates. Maximal degree in co-relation 3360. Up to 685 conditions per place. [2022-11-25 17:12:30,806 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 56 selfloop transitions, 7 changer transitions 12/80 dead transitions. [2022-11-25 17:12:30,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 80 transitions, 469 flow [2022-11-25 17:12:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:12:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:12:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-11-25 17:12:30,809 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4631578947368421 [2022-11-25 17:12:30,809 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 572 transitions. [2022-11-25 17:12:30,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 572 transitions. [2022-11-25 17:12:30,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:30,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 572 transitions. [2022-11-25 17:12:30,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,814 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,815 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 124 flow. Second operand 5 states and 572 transitions. [2022-11-25 17:12:30,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 80 transitions, 469 flow [2022-11-25 17:12:30,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 80 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:12:30,818 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 182 flow [2022-11-25 17:12:30,818 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-11-25 17:12:30,819 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-11-25 17:12:30,819 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 182 flow [2022-11-25 17:12:30,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:30,819 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:30,819 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:30,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:12:30,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 937625621, now seen corresponding path program 1 times [2022-11-25 17:12:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:30,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018883905] [2022-11-25 17:12:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:31,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:31,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018883905] [2022-11-25 17:12:31,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018883905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:31,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:31,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:12:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087433074] [2022-11-25 17:12:31,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:31,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:12:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:31,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:12:31,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:12:31,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 247 [2022-11-25 17:12:31,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:31,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:31,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 247 [2022-11-25 17:12:31,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:32,034 INFO L130 PetriNetUnfolder]: 944/1613 cut-off events. [2022-11-25 17:12:32,034 INFO L131 PetriNetUnfolder]: For 1686/1686 co-relation queries the response was YES. [2022-11-25 17:12:32,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5900 conditions, 1613 events. 944/1613 cut-off events. For 1686/1686 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8428 event pairs, 281 based on Foata normal form. 23/1636 useless extension candidates. Maximal degree in co-relation 5889. Up to 799 conditions per place. [2022-11-25 17:12:32,046 INFO L137 encePairwiseOnDemand]: 242/247 looper letters, 45 selfloop transitions, 8 changer transitions 9/63 dead transitions. [2022-11-25 17:12:32,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 433 flow [2022-11-25 17:12:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:12:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:12:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2022-11-25 17:12:32,049 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4564777327935223 [2022-11-25 17:12:32,049 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2022-11-25 17:12:32,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2022-11-25 17:12:32,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:32,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2022-11-25 17:12:32,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,054 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,054 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 182 flow. Second operand 4 states and 451 transitions. [2022-11-25 17:12:32,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 433 flow [2022-11-25 17:12:32,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:12:32,067 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 206 flow [2022-11-25 17:12:32,067 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-11-25 17:12:32,069 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-11-25 17:12:32,069 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 206 flow [2022-11-25 17:12:32,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:32,070 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:32,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:12:32,070 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1212723153, now seen corresponding path program 1 times [2022-11-25 17:12:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:32,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839858979] [2022-11-25 17:12:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:32,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839858979] [2022-11-25 17:12:32,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839858979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:32,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:32,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:12:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929277073] [2022-11-25 17:12:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:32,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:12:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:12:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:12:32,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 247 [2022-11-25 17:12:32,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:32,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 247 [2022-11-25 17:12:32,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:32,675 INFO L130 PetriNetUnfolder]: 432/810 cut-off events. [2022-11-25 17:12:32,675 INFO L131 PetriNetUnfolder]: For 1165/1189 co-relation queries the response was YES. [2022-11-25 17:12:32,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 810 events. 432/810 cut-off events. For 1165/1189 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4220 event pairs, 58 based on Foata normal form. 107/903 useless extension candidates. Maximal degree in co-relation 2939. Up to 332 conditions per place. [2022-11-25 17:12:32,680 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 49 selfloop transitions, 8 changer transitions 35/98 dead transitions. [2022-11-25 17:12:32,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 98 transitions, 710 flow [2022-11-25 17:12:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:12:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:12:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2022-11-25 17:12:32,684 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46356275303643724 [2022-11-25 17:12:32,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2022-11-25 17:12:32,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2022-11-25 17:12:32,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:32,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2022-11-25 17:12:32,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,690 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,690 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 206 flow. Second operand 6 states and 687 transitions. [2022-11-25 17:12:32,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 98 transitions, 710 flow [2022-11-25 17:12:32,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 98 transitions, 695 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:12:32,701 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 256 flow [2022-11-25 17:12:32,701 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-11-25 17:12:32,705 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2022-11-25 17:12:32,705 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 256 flow [2022-11-25 17:12:32,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:32,706 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:32,706 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:32,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:12:32,707 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:32,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash -989245148, now seen corresponding path program 1 times [2022-11-25 17:12:32,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:32,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658763111] [2022-11-25 17:12:32,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:32,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:33,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658763111] [2022-11-25 17:12:33,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658763111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:33,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:33,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:12:33,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881362228] [2022-11-25 17:12:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:33,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:12:33,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:12:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:12:33,045 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 247 [2022-11-25 17:12:33,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:33,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 247 [2022-11-25 17:12:33,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:33,338 INFO L130 PetriNetUnfolder]: 307/612 cut-off events. [2022-11-25 17:12:33,338 INFO L131 PetriNetUnfolder]: For 1193/1217 co-relation queries the response was YES. [2022-11-25 17:12:33,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 612 events. 307/612 cut-off events. For 1193/1217 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3213 event pairs, 47 based on Foata normal form. 38/640 useless extension candidates. Maximal degree in co-relation 2485. Up to 243 conditions per place. [2022-11-25 17:12:33,342 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 41 selfloop transitions, 11 changer transitions 34/91 dead transitions. [2022-11-25 17:12:33,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 702 flow [2022-11-25 17:12:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:12:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:12:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 893 transitions. [2022-11-25 17:12:33,346 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2022-11-25 17:12:33,346 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 893 transitions. [2022-11-25 17:12:33,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 893 transitions. [2022-11-25 17:12:33,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:33,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 893 transitions. [2022-11-25 17:12:33,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.625) internal successors, (893), 8 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,355 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,355 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 256 flow. Second operand 8 states and 893 transitions. [2022-11-25 17:12:33,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 702 flow [2022-11-25 17:12:33,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 661 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-11-25 17:12:33,369 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 227 flow [2022-11-25 17:12:33,369 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=227, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2022-11-25 17:12:33,371 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2022-11-25 17:12:33,371 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 227 flow [2022-11-25 17:12:33,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,373 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:33,373 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] [2022-11-25 17:12:33,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:12:33,375 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:33,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1690059360, now seen corresponding path program 1 times [2022-11-25 17:12:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:33,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379492883] [2022-11-25 17:12:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:33,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379492883] [2022-11-25 17:12:33,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379492883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:33,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:33,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:12:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90641800] [2022-11-25 17:12:33,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:33,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:12:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:33,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:12:33,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:12:33,671 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 247 [2022-11-25 17:12:33,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:33,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 247 [2022-11-25 17:12:33,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:33,817 INFO L130 PetriNetUnfolder]: 177/364 cut-off events. [2022-11-25 17:12:33,817 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2022-11-25 17:12:33,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 364 events. 177/364 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1561 event pairs, 46 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1506. Up to 223 conditions per place. [2022-11-25 17:12:33,820 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 28 selfloop transitions, 1 changer transitions 31/62 dead transitions. [2022-11-25 17:12:33,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 531 flow [2022-11-25 17:12:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:12:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:12:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2022-11-25 17:12:33,824 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4757085020242915 [2022-11-25 17:12:33,824 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2022-11-25 17:12:33,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2022-11-25 17:12:33,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:33,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2022-11-25 17:12:33,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,830 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,830 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 227 flow. Second operand 4 states and 470 transitions. [2022-11-25 17:12:33,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 531 flow [2022-11-25 17:12:33,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 429 flow, removed 31 selfloop flow, removed 8 redundant places. [2022-11-25 17:12:33,837 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 145 flow [2022-11-25 17:12:33,839 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2022-11-25 17:12:33,839 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2022-11-25 17:12:33,840 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 145 flow [2022-11-25 17:12:33,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:33,840 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:33,840 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] [2022-11-25 17:12:33,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:12:33,841 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:33,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash 193406294, now seen corresponding path program 2 times [2022-11-25 17:12:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:33,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291465513] [2022-11-25 17:12:33,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:34,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291465513] [2022-11-25 17:12:34,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291465513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:34,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:34,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:12:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845619142] [2022-11-25 17:12:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:34,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:12:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:34,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:12:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:12:34,888 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 247 [2022-11-25 17:12:34,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:34,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:34,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 247 [2022-11-25 17:12:34,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:35,060 INFO L130 PetriNetUnfolder]: 68/165 cut-off events. [2022-11-25 17:12:35,060 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-11-25 17:12:35,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 165 events. 68/165 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 537 event pairs, 17 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 588. Up to 85 conditions per place. [2022-11-25 17:12:35,062 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 25 selfloop transitions, 7 changer transitions 18/52 dead transitions. [2022-11-25 17:12:35,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 366 flow [2022-11-25 17:12:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:12:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:12:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 677 transitions. [2022-11-25 17:12:35,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45681511470985153 [2022-11-25 17:12:35,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 677 transitions. [2022-11-25 17:12:35,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 677 transitions. [2022-11-25 17:12:35,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:35,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 677 transitions. [2022-11-25 17:12:35,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:35,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:35,071 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:35,071 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 145 flow. Second operand 6 states and 677 transitions. [2022-11-25 17:12:35,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 366 flow [2022-11-25 17:12:35,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 345 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-11-25 17:12:35,073 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 154 flow [2022-11-25 17:12:35,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2022-11-25 17:12:35,074 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2022-11-25 17:12:35,074 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 154 flow [2022-11-25 17:12:35,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:35,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:35,075 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] [2022-11-25 17:12:35,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:12:35,075 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:35,076 INFO L85 PathProgramCache]: Analyzing trace with hash 535996010, now seen corresponding path program 3 times [2022-11-25 17:12:35,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:35,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72125322] [2022-11-25 17:12:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:12:35,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:12:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:12:35,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:12:35,239 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:12:35,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 17:12:35,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 17:12:35,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 17:12:35,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 17:12:35,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 17:12:35,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 17:12:35,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 17:12:35,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 17:12:35,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 17:12:35,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 17:12:35,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 17:12:35,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 17:12:35,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 17:12:35,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:12:35,245 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:35,251 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:12:35,251 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:12:35,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:12:35 BasicIcfg [2022-11-25 17:12:35,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:12:35,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:12:35,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:12:35,335 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:12:35,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:18" (3/4) ... [2022-11-25 17:12:35,342 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:12:35,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:12:35,343 INFO L158 Benchmark]: Toolchain (without parser) took 18638.31ms. Allocated memory was 172.0MB in the beginning and 406.8MB in the end (delta: 234.9MB). Free memory was 134.3MB in the beginning and 337.1MB in the end (delta: -202.7MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2022-11-25 17:12:35,343 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 127.9MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:12:35,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.74ms. Allocated memory is still 172.0MB. Free memory was 134.3MB in the beginning and 106.4MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:12:35,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.85ms. Allocated memory is still 172.0MB. Free memory was 106.4MB in the beginning and 103.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:12:35,344 INFO L158 Benchmark]: Boogie Preprocessor took 41.45ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 101.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:12:35,344 INFO L158 Benchmark]: RCFGBuilder took 901.73ms. Allocated memory is still 172.0MB. Free memory was 101.5MB in the beginning and 60.9MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-25 17:12:35,345 INFO L158 Benchmark]: TraceAbstraction took 16790.27ms. Allocated memory was 172.0MB in the beginning and 406.8MB in the end (delta: 234.9MB). Free memory was 60.3MB in the beginning and 337.1MB in the end (delta: -276.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:12:35,345 INFO L158 Benchmark]: Witness Printer took 7.62ms. Allocated memory is still 406.8MB. Free memory is still 337.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:12:35,347 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.32ms. Allocated memory is still 127.9MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.74ms. Allocated memory is still 172.0MB. Free memory was 134.3MB in the beginning and 106.4MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.85ms. Allocated memory is still 172.0MB. Free memory was 106.4MB in the beginning and 103.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.45ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 101.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 901.73ms. Allocated memory is still 172.0MB. Free memory was 101.5MB in the beginning and 60.9MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16790.27ms. Allocated memory was 172.0MB in the beginning and 406.8MB in the end (delta: 234.9MB). Free memory was 60.3MB in the beginning and 337.1MB in the end (delta: -276.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 7.62ms. Allocated memory is still 406.8MB. Free memory is still 337.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.8s, 130 PlacesBefore, 41 PlacesAfterwards, 122 TransitionsBefore, 32 TransitionsAfterwards, 2244 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 122 TotalNumberOfCompositions, 5858 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2715, independent: 2535, independent conditional: 0, independent unconditional: 2535, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1545, independent: 1491, independent conditional: 0, independent unconditional: 1491, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1545, independent: 1463, independent conditional: 0, independent unconditional: 1463, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 512, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 445, dependent conditional: 0, dependent unconditional: 445, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2715, independent: 1044, independent conditional: 0, independent unconditional: 1044, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 1545, unknown conditional: 0, unknown unconditional: 1545] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=-2, t763={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=-1, t763={5:0}, t764={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 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: 16.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 473 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1125 IncrementalHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 58 mSDtfsCounter, 1125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=8, InterpolantAutomatonStates: 51, 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.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:12:35,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:12:38,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:12:38,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:12:38,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:12:38,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:12:38,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:12:38,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:12:38,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:12:38,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:12:38,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:12:38,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:12:38,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:12:38,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:12:38,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:12:38,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:12:38,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:12:38,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:12:38,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:12:38,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:12:38,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:12:38,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:12:38,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:12:38,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:12:38,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:12:38,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:12:38,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:12:38,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:12:38,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:12:38,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:12:38,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:12:38,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:12:38,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:12:38,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:12:38,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:12:38,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:12:38,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:12:38,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:12:38,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:12:38,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:12:38,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:12:38,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:12:38,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:12:38,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:12:38,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:12:38,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:12:38,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:12:38,182 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:12:38,182 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:12:38,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:12:38,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:12:38,184 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:12:38,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:12:38,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:12:38,186 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:12:38,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:12:38,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:12:38,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:12:38,187 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:12:38,187 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:12:38,187 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:12:38,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:12:38,188 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:12:38,188 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:12:38,188 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:12:38,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:12:38,189 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:12:38,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:12:38,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:12:38,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:12:38,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:12:38,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:12:38,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:12:38,190 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:12:38,191 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:12:38,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:12:38,191 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:12:38,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:12:38,192 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:12:38,192 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_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a [2022-11-25 17:12:38,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:12:38,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:12:38,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:12:38,627 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:12:38,627 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:12:38,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i [2022-11-25 17:12:41,910 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:12:42,218 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:12:42,219 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/sv-benchmarks/c/pthread-wmm/mix028_tso.i [2022-11-25 17:12:42,240 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/data/155b2dbd2/7af8f47ba31d4bebb0da973f2d7609eb/FLAGe48d47288 [2022-11-25 17:12:42,266 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/data/155b2dbd2/7af8f47ba31d4bebb0da973f2d7609eb [2022-11-25 17:12:42,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:12:42,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:12:42,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:12:42,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:12:42,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:12:42,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:42" (1/1) ... [2022-11-25 17:12:42,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2337d9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:42, skipping insertion in model container [2022-11-25 17:12:42,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:42" (1/1) ... [2022-11-25 17:12:42,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:12:42,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:12:42,576 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_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/sv-benchmarks/c/pthread-wmm/mix028_tso.i[944,957] [2022-11-25 17:12:42,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:12:42,820 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:12:42,847 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_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/sv-benchmarks/c/pthread-wmm/mix028_tso.i[944,957] [2022-11-25 17:12:42,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:12:42,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:12:42,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:12:43,015 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:12:43,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43 WrapperNode [2022-11-25 17:12:43,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:12:43,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:12:43,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:12:43,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:12:43,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,069 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2022-11-25 17:12:43,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:12:43,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:12:43,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:12:43,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:12:43,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,100 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:12:43,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:12:43,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:12:43,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:12:43,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (1/1) ... [2022-11-25 17:12:43,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:12:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:12:43,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:12:43,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:12:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:12:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:12:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:12:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:12:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:12:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:12:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:12:43,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:12:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:12:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:12:43,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:12:43,199 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:12:43,347 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:12:43,349 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:12:43,919 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:12:44,071 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:12:44,072 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:12:44,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:44 BoogieIcfgContainer [2022-11-25 17:12:44,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:12:44,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:12:44,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:12:44,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:12:44,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:12:42" (1/3) ... [2022-11-25 17:12:44,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e302135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:12:44, skipping insertion in model container [2022-11-25 17:12:44,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:43" (2/3) ... [2022-11-25 17:12:44,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e302135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:12:44, skipping insertion in model container [2022-11-25 17:12:44,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:44" (3/3) ... [2022-11-25 17:12:44,083 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2022-11-25 17:12:44,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:12:44,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 17:12:44,102 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:12:44,188 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:12:44,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-11-25 17:12:44,316 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-11-25 17:12:44,316 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:12:44,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:12:44,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 267 flow [2022-11-25 17:12:44,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 123 transitions, 255 flow [2022-11-25 17:12:44,334 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:12:44,357 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 255 flow [2022-11-25 17:12:44,361 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 255 flow [2022-11-25 17:12:44,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 255 flow [2022-11-25 17:12:44,416 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-11-25 17:12:44,417 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:12:44,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:12:44,425 INFO L119 LiptonReduction]: Number of co-enabled transitions 2244 [2022-11-25 17:12:53,627 INFO L134 LiptonReduction]: Checked pairs total: 5852 [2022-11-25 17:12:53,629 INFO L136 LiptonReduction]: Total number of compositions: 121 [2022-11-25 17:12:53,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:12:53,674 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;@5ee9642e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:12:53,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 17:12:53,680 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:12:53,680 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:12:53,681 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:53,686 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:12:53,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:53,692 INFO L85 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2022-11-25 17:12:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:12:53,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047062288] [2022-11-25 17:12:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:53,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:53,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:12:53,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:12:53,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:12:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:12:53,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:53,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:12:53,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:12:53,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047062288] [2022-11-25 17:12:53,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047062288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:53,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:53,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:12:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445142385] [2022-11-25 17:12:53,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:53,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:12:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:12:53,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:12:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:12:53,883 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2022-11-25 17:12:53,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:53,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:53,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2022-11-25 17:12:53,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:54,416 INFO L130 PetriNetUnfolder]: 1101/1661 cut-off events. [2022-11-25 17:12:54,416 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-25 17:12:54,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 1661 events. 1101/1661 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7893 event pairs, 1101 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 3323. Up to 1637 conditions per place. [2022-11-25 17:12:54,435 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-11-25 17:12:54,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2022-11-25 17:12:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:12:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:12:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 255 transitions. [2022-11-25 17:12:54,458 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5161943319838057 [2022-11-25 17:12:54,459 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 255 transitions. [2022-11-25 17:12:54,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 255 transitions. [2022-11-25 17:12:54,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:54,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 255 transitions. [2022-11-25 17:12:54,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:54,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:54,479 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:54,481 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 255 transitions. [2022-11-25 17:12:54,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2022-11-25 17:12:54,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:12:54,487 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-11-25 17:12:54,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-11-25 17:12:54,497 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-11-25 17:12:54,497 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-11-25 17:12:54,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:54,498 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:54,498 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:54,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 17:12:54,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:54,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1077589470, now seen corresponding path program 1 times [2022-11-25 17:12:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:12:54,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812287973] [2022-11-25 17:12:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:54,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:54,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:12:54,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:12:54,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:12:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:54,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:12:54,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:54,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:12:54,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:12:54,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812287973] [2022-11-25 17:12:54,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812287973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:54,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:54,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:12:54,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833456011] [2022-11-25 17:12:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:54,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:12:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:12:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:12:54,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:12:54,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 247 [2022-11-25 17:12:54,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:54,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:54,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 247 [2022-11-25 17:12:54,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:55,265 INFO L130 PetriNetUnfolder]: 910/1452 cut-off events. [2022-11-25 17:12:55,266 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:12:55,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1452 events. 910/1452 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7471 event pairs, 146 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 2845. Up to 1101 conditions per place. [2022-11-25 17:12:55,275 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 28 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2022-11-25 17:12:55,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow [2022-11-25 17:12:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:12:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:12:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-11-25 17:12:55,281 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4979757085020243 [2022-11-25 17:12:55,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-11-25 17:12:55,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-11-25 17:12:55,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:55,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-11-25 17:12:55,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:55,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:55,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:55,289 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 369 transitions. [2022-11-25 17:12:55,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow [2022-11-25 17:12:55,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:12:55,291 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-11-25 17:12:55,291 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-11-25 17:12:55,292 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-11-25 17:12:55,292 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-11-25 17:12:55,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:55,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:55,293 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:55,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:55,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:55,505 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:55,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash -476265160, now seen corresponding path program 1 times [2022-11-25 17:12:55,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:12:55,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111965291] [2022-11-25 17:12:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:55,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:55,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:12:55,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:12:55,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:12:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:55,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:12:55,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:55,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:12:55,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:12:55,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111965291] [2022-11-25 17:12:55,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111965291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:55,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:55,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:12:55,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069797037] [2022-11-25 17:12:55,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:55,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:12:55,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:12:55,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:12:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:12:55,719 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 247 [2022-11-25 17:12:55,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:55,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:55,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 247 [2022-11-25 17:12:55,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:56,046 INFO L130 PetriNetUnfolder]: 514/856 cut-off events. [2022-11-25 17:12:56,047 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-25 17:12:56,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 856 events. 514/856 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3994 event pairs, 96 based on Foata normal form. 60/877 useless extension candidates. Maximal degree in co-relation 1788. Up to 609 conditions per place. [2022-11-25 17:12:56,052 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 29 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2022-11-25 17:12:56,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 234 flow [2022-11-25 17:12:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:12:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:12:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2022-11-25 17:12:56,055 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4688259109311741 [2022-11-25 17:12:56,055 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2022-11-25 17:12:56,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2022-11-25 17:12:56,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:56,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2022-11-25 17:12:56,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,063 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 579 transitions. [2022-11-25 17:12:56,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 234 flow [2022-11-25 17:12:56,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:12:56,067 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2022-11-25 17:12:56,067 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 17:12:56,069 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 17:12:56,070 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2022-11-25 17:12:56,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:56,070 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:56,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:56,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1381179569, now seen corresponding path program 1 times [2022-11-25 17:12:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:12:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617904248] [2022-11-25 17:12:56,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:56,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:56,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:12:56,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:12:56,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:12:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:56,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:12:56,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:56,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:12:56,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:12:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617904248] [2022-11-25 17:12:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617904248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:56,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:56,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:12:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562995546] [2022-11-25 17:12:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:56,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:12:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:12:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:12:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:12:56,484 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 247 [2022-11-25 17:12:56,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:56,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 247 [2022-11-25 17:12:56,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:56,800 INFO L130 PetriNetUnfolder]: 208/396 cut-off events. [2022-11-25 17:12:56,800 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-11-25 17:12:56,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 396 events. 208/396 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1620 event pairs, 44 based on Foata normal form. 36/419 useless extension candidates. Maximal degree in co-relation 1068. Up to 136 conditions per place. [2022-11-25 17:12:56,803 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 37 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2022-11-25 17:12:56,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 338 flow [2022-11-25 17:12:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:12:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:12:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 695 transitions. [2022-11-25 17:12:56,807 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4689608636977058 [2022-11-25 17:12:56,807 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 695 transitions. [2022-11-25 17:12:56,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 695 transitions. [2022-11-25 17:12:56,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:56,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 695 transitions. [2022-11-25 17:12:56,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,816 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,816 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 695 transitions. [2022-11-25 17:12:56,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 338 flow [2022-11-25 17:12:56,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:12:56,820 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2022-11-25 17:12:56,820 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-11-25 17:12:56,821 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-11-25 17:12:56,821 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2022-11-25 17:12:56,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:56,822 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:56,822 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:56,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:57,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:57,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:57,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:57,035 INFO L85 PathProgramCache]: Analyzing trace with hash 305431417, now seen corresponding path program 1 times [2022-11-25 17:12:57,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:12:57,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998218243] [2022-11-25 17:12:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:57,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:57,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:12:57,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:12:57,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:12:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:12:57,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:57,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:12:57,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:12:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998218243] [2022-11-25 17:12:57,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998218243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:57,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:57,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:12:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109125625] [2022-11-25 17:12:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:57,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:12:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:12:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:12:57,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:12:57,282 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 247 [2022-11-25 17:12:57,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:57,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:57,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 247 [2022-11-25 17:12:57,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:57,599 INFO L130 PetriNetUnfolder]: 120/237 cut-off events. [2022-11-25 17:12:57,599 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2022-11-25 17:12:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 237 events. 120/237 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 834 event pairs, 39 based on Foata normal form. 10/243 useless extension candidates. Maximal degree in co-relation 708. Up to 90 conditions per place. [2022-11-25 17:12:57,601 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 34 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2022-11-25 17:12:57,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 336 flow [2022-11-25 17:12:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:12:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:12:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 791 transitions. [2022-11-25 17:12:57,604 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4574898785425101 [2022-11-25 17:12:57,604 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 791 transitions. [2022-11-25 17:12:57,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 791 transitions. [2022-11-25 17:12:57,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:57,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 791 transitions. [2022-11-25 17:12:57,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:57,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:57,611 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:57,612 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 791 transitions. [2022-11-25 17:12:57,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 336 flow [2022-11-25 17:12:57,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 300 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-25 17:12:57,620 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2022-11-25 17:12:57,621 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-11-25 17:12:57,623 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-11-25 17:12:57,624 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2022-11-25 17:12:57,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:57,624 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:57,625 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] [2022-11-25 17:12:57,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:57,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:57,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1743478169, now seen corresponding path program 1 times [2022-11-25 17:12:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:12:57,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497739649] [2022-11-25 17:12:57,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:57,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:57,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:12:57,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:12:57,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:12:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:12:57,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:58,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-11-25 17:12:58,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:12:58,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:12:58,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497739649] [2022-11-25 17:12:58,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497739649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:58,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:58,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:12:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569305885] [2022-11-25 17:12:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:58,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:12:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:12:58,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:12:58,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:12:58,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 247 [2022-11-25 17:12:58,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:58,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 247 [2022-11-25 17:12:58,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:58,255 INFO L130 PetriNetUnfolder]: 151/307 cut-off events. [2022-11-25 17:12:58,256 INFO L131 PetriNetUnfolder]: For 408/408 co-relation queries the response was YES. [2022-11-25 17:12:58,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 307 events. 151/307 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1260 event pairs, 28 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 904. Up to 173 conditions per place. [2022-11-25 17:12:58,258 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 55 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-11-25 17:12:58,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 412 flow [2022-11-25 17:12:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:12:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:12:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2022-11-25 17:12:58,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48582995951417 [2022-11-25 17:12:58,267 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2022-11-25 17:12:58,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2022-11-25 17:12:58,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:58,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2022-11-25 17:12:58,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,278 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,278 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 4 states and 480 transitions. [2022-11-25 17:12:58,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 412 flow [2022-11-25 17:12:58,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 332 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-25 17:12:58,283 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 115 flow [2022-11-25 17:12:58,286 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-11-25 17:12:58,287 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-11-25 17:12:58,287 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 115 flow [2022-11-25 17:12:58,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:58,288 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] [2022-11-25 17:12:58,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:58,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:58,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -15160473, now seen corresponding path program 2 times [2022-11-25 17:12:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:12:58,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366739662] [2022-11-25 17:12:58,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:12:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:12:58,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:12:58,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:12:58,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:12:58,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:12:58,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:12:58,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:58,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:12:58,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:12:58,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366739662] [2022-11-25 17:12:58,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366739662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:58,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:58,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:12:58,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697217988] [2022-11-25 17:12:58,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:58,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:12:58,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:12:58,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:12:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:12:58,687 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 247 [2022-11-25 17:12:58,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:12:58,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 247 [2022-11-25 17:12:58,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:12:58,867 INFO L130 PetriNetUnfolder]: 260/514 cut-off events. [2022-11-25 17:12:58,867 INFO L131 PetriNetUnfolder]: For 390/390 co-relation queries the response was YES. [2022-11-25 17:12:58,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 514 events. 260/514 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2484 event pairs, 111 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 1453. Up to 295 conditions per place. [2022-11-25 17:12:58,871 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 47 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-11-25 17:12:58,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 297 flow [2022-11-25 17:12:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:12:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:12:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2022-11-25 17:12:58,874 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4966261808367072 [2022-11-25 17:12:58,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2022-11-25 17:12:58,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2022-11-25 17:12:58,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:12:58,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2022-11-25 17:12:58,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,878 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 115 flow. Second operand 3 states and 368 transitions. [2022-11-25 17:12:58,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 297 flow [2022-11-25 17:12:58,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:12:58,883 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 126 flow [2022-11-25 17:12:58,884 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-11-25 17:12:58,884 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2022-11-25 17:12:58,885 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 126 flow [2022-11-25 17:12:58,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:12:58,885 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:12:58,885 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] [2022-11-25 17:12:58,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:59,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:59,104 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:12:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1379300327, now seen corresponding path program 3 times [2022-11-25 17:12:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:12:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931215622] [2022-11-25 17:12:59,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:12:59,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:59,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:12:59,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:12:59,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:12:59,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:12:59,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:12:59,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:12:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:12:59,461 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:12:59,461 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:12:59,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 17:12:59,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 17:12:59,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 17:12:59,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 17:12:59,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 17:12:59,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 17:12:59,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 17:12:59,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 17:12:59,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 17:12:59,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 17:12:59,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 17:12:59,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 17:12:59,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 17:12:59,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:59,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:12:59,681 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-25 17:12:59,685 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:12:59,686 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:12:59,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:12:59 BasicIcfg [2022-11-25 17:12:59,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:12:59,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:12:59,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:12:59,778 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:12:59,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:44" (3/4) ... [2022-11-25 17:12:59,781 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:12:59,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:12:59,782 INFO L158 Benchmark]: Toolchain (without parser) took 17512.35ms. Allocated memory was 79.7MB in the beginning and 176.2MB in the end (delta: 96.5MB). Free memory was 58.9MB in the beginning and 59.6MB in the end (delta: -649.4kB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2022-11-25 17:12:59,782 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 79.7MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:12:59,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.04ms. Allocated memory is still 79.7MB. Free memory was 58.6MB in the beginning and 55.2MB in the end (delta: 3.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2022-11-25 17:12:59,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.21ms. Allocated memory is still 79.7MB. Free memory was 55.2MB in the beginning and 52.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:12:59,784 INFO L158 Benchmark]: Boogie Preprocessor took 36.30ms. Allocated memory is still 79.7MB. Free memory was 51.9MB in the beginning and 49.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:12:59,784 INFO L158 Benchmark]: RCFGBuilder took 967.23ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 49.8MB in the beginning and 50.0MB in the end (delta: -198.1kB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-11-25 17:12:59,785 INFO L158 Benchmark]: TraceAbstraction took 15695.53ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 49.4MB in the beginning and 60.6MB in the end (delta: -11.2MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2022-11-25 17:12:59,785 INFO L158 Benchmark]: Witness Printer took 9.14ms. Allocated memory is still 176.2MB. Free memory was 60.6MB in the beginning and 59.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:12:59,787 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.84ms. Allocated memory is still 79.7MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 743.04ms. Allocated memory is still 79.7MB. Free memory was 58.6MB in the beginning and 55.2MB in the end (delta: 3.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.21ms. Allocated memory is still 79.7MB. Free memory was 55.2MB in the beginning and 52.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.30ms. Allocated memory is still 79.7MB. Free memory was 51.9MB in the beginning and 49.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 967.23ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 49.8MB in the beginning and 50.0MB in the end (delta: -198.1kB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15695.53ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 49.4MB in the beginning and 60.6MB in the end (delta: -11.2MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 9.14ms. Allocated memory is still 176.2MB. Free memory was 60.6MB in the beginning and 59.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 131 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 2244 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 5852 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2779, independent: 2599, independent conditional: 0, independent unconditional: 2599, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1551, independent: 1498, independent conditional: 0, independent unconditional: 1498, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1551, independent: 1470, independent conditional: 0, independent unconditional: 1470, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 414, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 359, dependent conditional: 0, dependent unconditional: 359, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2779, independent: 1101, independent conditional: 0, independent unconditional: 1101, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1551, unknown conditional: 0, unknown unconditional: 1551] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=65536, t763={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=65537, t763={-6:0}, t764={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=65538, t763={-6:0}, t764={-10:0}, t765={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=4, weak$$choice2=2, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={-6:0}, t764={-10:0}, t765={-2:0}, weak$$choice0=4, weak$$choice2=2, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=3, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 832]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 13 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: 15.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 23 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 30, 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.4s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 206 SizeOfPredicates, 10 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:12:59,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c240a3e-55f7-4ef0-889d-0bedbbe8690b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample