./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57c8b47d74ada5c94291d16aafebbb644062493fff61510a323122bcd88ba5b1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 13:42:49,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:42:49,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:42:49,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:42:49,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:42:49,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:42:49,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:42:49,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:42:49,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:42:49,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:42:49,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:42:49,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:42:49,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:42:49,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:42:49,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:42:49,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:42:49,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:42:49,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:42:49,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:42:49,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:42:49,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:42:49,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:42:49,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:42:49,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:42:49,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:42:49,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:42:49,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:42:49,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:42:49,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:42:49,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:42:49,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:42:49,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:42:49,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:42:49,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:42:49,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:42:49,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:42:49,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:42:49,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:42:49,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:42:49,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:42:49,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:42:49,463 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 13:42:49,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:42:49,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:42:49,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:42:49,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:42:49,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:42:49,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:42:49,486 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:42:49,486 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:42:49,486 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:42:49,486 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:42:49,486 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:42:49,486 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:42:49,487 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:42:49,487 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:42:49,487 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:42:49,487 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:42:49,487 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:42:49,487 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:42:49,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 13:42:49,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 13:42:49,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:42:49,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:42:49,488 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 13:42:49,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:42:49,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:42:49,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:42:49,489 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 13:42:49,489 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 13:42:49,489 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 13:42:49,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:42:49,489 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 13:42:49,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:42:49,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:42:49,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:42:49,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:42:49,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:42:49,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:42:49,491 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:42:49,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:42:49,491 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:42:49,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:42:49,491 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:42:49,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 57c8b47d74ada5c94291d16aafebbb644062493fff61510a323122bcd88ba5b1 [2022-12-14 13:42:49,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:42:49,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:42:49,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:42:49,691 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:42:49,691 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:42:49,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2022-12-14 13:42:52,315 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:42:52,532 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:42:52,532 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2022-12-14 13:42:52,544 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/data/f6cc76d87/f4bb65e38fe44d7da46282cc23f4f631/FLAG948bbe011 [2022-12-14 13:42:52,554 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/data/f6cc76d87/f4bb65e38fe44d7da46282cc23f4f631 [2022-12-14 13:42:52,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:42:52,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:42:52,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:42:52,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:42:52,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:42:52,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:52,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df1059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52, skipping insertion in model container [2022-12-14 13:42:52,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:52,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:42:52,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:42:52,733 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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i[994,1007] [2022-12-14 13:42:52,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:42:52,907 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:42:52,918 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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i[994,1007] [2022-12-14 13:42:52,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:42:52,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:42:52,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:42:52,996 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:42:52,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52 WrapperNode [2022-12-14 13:42:52,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:42:52,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:42:52,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:42:52,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:42:53,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,052 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-12-14 13:42:53,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:42:53,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:42:53,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:42:53,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:42:53,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,077 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:42:53,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:42:53,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:42:53,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:42:53,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (1/1) ... [2022-12-14 13:42:53,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:42:53,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:42:53,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:42:53,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:42:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 13:42:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 13:42:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 13:42:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:42:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 13:42:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 13:42:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 13:42:53,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 13:42:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 13:42:53,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 13:42:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 13:42:53,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 13:42:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 13:42:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 13:42:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:42:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 13:42:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:42:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:42:53,147 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 13:42:53,257 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:42:53,258 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:42:53,710 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:42:54,110 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:42:54,110 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 13:42:54,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:42:54 BoogieIcfgContainer [2022-12-14 13:42:54,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:42:54,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:42:54,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:42:54,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:42:54,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:42:52" (1/3) ... [2022-12-14 13:42:54,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e71a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:42:54, skipping insertion in model container [2022-12-14 13:42:54,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:42:52" (2/3) ... [2022-12-14 13:42:54,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e71a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:42:54, skipping insertion in model container [2022-12-14 13:42:54,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:42:54" (3/3) ... [2022-12-14 13:42:54,120 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2022-12-14 13:42:54,135 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:42:54,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-12-14 13:42:54,135 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 13:42:54,279 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 13:42:54,307 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 13:42:54,318 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 210 transitions, 440 flow [2022-12-14 13:42:54,320 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 210 transitions, 440 flow [2022-12-14 13:42:54,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 210 transitions, 440 flow [2022-12-14 13:42:54,393 INFO L130 PetriNetUnfolder]: 2/206 cut-off events. [2022-12-14 13:42:54,393 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 13:42:54,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 2/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 342 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2022-12-14 13:42:54,402 INFO L119 LiptonReduction]: Number of co-enabled transitions 10744 [2022-12-14 13:43:10,071 INFO L134 LiptonReduction]: Checked pairs total: 49406 [2022-12-14 13:43:10,072 INFO L136 LiptonReduction]: Total number of compositions: 199 [2022-12-14 13:43:10,080 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 93 transitions, 206 flow [2022-12-14 13:43:20,096 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:20,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:43:20,117 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=FINITE_AUTOMATA, 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;@f058375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:43:20,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2022-12-14 13:43:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 13:43:20,670 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:20,670 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 13:43:20,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1322, now seen corresponding path program 1 times [2022-12-14 13:43:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:20,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66670049] [2022-12-14 13:43:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:20,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:20,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66670049] [2022-12-14 13:43:20,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66670049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:20,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:20,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 13:43:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649062787] [2022-12-14 13:43:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 13:43:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:20,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 13:43:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:43:21,423 INFO L87 Difference]: Start difference. First operand has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:23,224 INFO L93 Difference]: Finished difference Result 77980 states and 344739 transitions. [2022-12-14 13:43:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 13:43:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-12-14 13:43:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:23,866 INFO L225 Difference]: With dead ends: 77980 [2022-12-14 13:43:23,866 INFO L226 Difference]: Without dead ends: 77980 [2022-12-14 13:43:23,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:43:23,870 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:23,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77980 states. [2022-12-14 13:43:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77980 to 77980. [2022-12-14 13:43:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77980 states, 72311 states have (on average 4.767448935846551) internal successors, (344739), 77979 states have internal predecessors, (344739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77980 states to 77980 states and 344739 transitions. [2022-12-14 13:43:26,549 INFO L78 Accepts]: Start accepts. Automaton has 77980 states and 344739 transitions. Word has length 1 [2022-12-14 13:43:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:26,549 INFO L495 AbstractCegarLoop]: Abstraction has 77980 states and 344739 transitions. [2022-12-14 13:43:26,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 77980 states and 344739 transitions. [2022-12-14 13:43:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 13:43:26,550 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:26,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 13:43:26,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:43:26,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash 40442723, now seen corresponding path program 1 times [2022-12-14 13:43:26,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:26,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852550721] [2022-12-14 13:43:26,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:26,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:26,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:26,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852550721] [2022-12-14 13:43:26,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852550721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:26,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:26,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:43:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753560609] [2022-12-14 13:43:26,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:26,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:43:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:26,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:43:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:26,729 INFO L87 Difference]: Start difference. First operand 77980 states and 344739 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:27,464 INFO L93 Difference]: Finished difference Result 39826 states and 171519 transitions. [2022-12-14 13:43:27,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:27,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 13:43:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:27,730 INFO L225 Difference]: With dead ends: 39826 [2022-12-14 13:43:27,730 INFO L226 Difference]: Without dead ends: 39826 [2022-12-14 13:43:27,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:27,731 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:27,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39826 states. [2022-12-14 13:43:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39826 to 39826. [2022-12-14 13:43:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39826 states, 38087 states have (on average 4.503347598918266) internal successors, (171519), 39825 states have internal predecessors, (171519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39826 states to 39826 states and 171519 transitions. [2022-12-14 13:43:28,950 INFO L78 Accepts]: Start accepts. Automaton has 39826 states and 171519 transitions. Word has length 4 [2022-12-14 13:43:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:28,950 INFO L495 AbstractCegarLoop]: Abstraction has 39826 states and 171519 transitions. [2022-12-14 13:43:28,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 39826 states and 171519 transitions. [2022-12-14 13:43:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 13:43:28,951 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:28,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 13:43:28,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:43:28,951 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 40442724, now seen corresponding path program 1 times [2022-12-14 13:43:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:28,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203646675] [2022-12-14 13:43:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:28,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:29,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:29,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203646675] [2022-12-14 13:43:29,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203646675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:29,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:29,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:43:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551562528] [2022-12-14 13:43:29,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:29,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:43:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:29,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:43:29,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:29,044 INFO L87 Difference]: Start difference. First operand 39826 states and 171519 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:29,324 INFO L93 Difference]: Finished difference Result 11558 states and 47571 transitions. [2022-12-14 13:43:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:29,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 13:43:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:29,376 INFO L225 Difference]: With dead ends: 11558 [2022-12-14 13:43:29,376 INFO L226 Difference]: Without dead ends: 11558 [2022-12-14 13:43:29,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:29,377 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:29,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11558 states. [2022-12-14 13:43:29,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11558 to 11558. [2022-12-14 13:43:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11558 states, 11361 states have (on average 4.187219434908899) internal successors, (47571), 11557 states have internal predecessors, (47571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11558 states to 11558 states and 47571 transitions. [2022-12-14 13:43:29,619 INFO L78 Accepts]: Start accepts. Automaton has 11558 states and 47571 transitions. Word has length 4 [2022-12-14 13:43:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:29,620 INFO L495 AbstractCegarLoop]: Abstraction has 11558 states and 47571 transitions. [2022-12-14 13:43:29,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 11558 states and 47571 transitions. [2022-12-14 13:43:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 13:43:29,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:29,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 13:43:29,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 13:43:29,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash 212016082, now seen corresponding path program 1 times [2022-12-14 13:43:29,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:29,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834774742] [2022-12-14 13:43:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:29,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:29,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834774742] [2022-12-14 13:43:29,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834774742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:29,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:29,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:43:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506120833] [2022-12-14 13:43:29,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:29,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:43:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:29,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:43:29,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:29,748 INFO L87 Difference]: Start difference. First operand 11558 states and 47571 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:29,942 INFO L93 Difference]: Finished difference Result 9726 states and 39747 transitions. [2022-12-14 13:43:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:29,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 13:43:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:29,987 INFO L225 Difference]: With dead ends: 9726 [2022-12-14 13:43:29,987 INFO L226 Difference]: Without dead ends: 9726 [2022-12-14 13:43:29,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:29,988 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:29,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9726 states. [2022-12-14 13:43:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9726 to 9726. [2022-12-14 13:43:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9726 states, 9580 states have (on average 4.148956158663883) internal successors, (39747), 9725 states have internal predecessors, (39747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9726 states to 9726 states and 39747 transitions. [2022-12-14 13:43:30,219 INFO L78 Accepts]: Start accepts. Automaton has 9726 states and 39747 transitions. Word has length 6 [2022-12-14 13:43:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:30,219 INFO L495 AbstractCegarLoop]: Abstraction has 9726 states and 39747 transitions. [2022-12-14 13:43:30,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 9726 states and 39747 transitions. [2022-12-14 13:43:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 13:43:30,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:30,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:30,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:43:30,222 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:30,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1520297805, now seen corresponding path program 1 times [2022-12-14 13:43:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:30,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147017564] [2022-12-14 13:43:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:30,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:30,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:30,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147017564] [2022-12-14 13:43:30,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147017564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:30,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:30,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:43:30,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021036934] [2022-12-14 13:43:30,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:30,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:43:30,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:30,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:43:30,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:30,389 INFO L87 Difference]: Start difference. First operand 9726 states and 39747 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:30,557 INFO L93 Difference]: Finished difference Result 9598 states and 39203 transitions. [2022-12-14 13:43:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:30,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 13:43:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:30,591 INFO L225 Difference]: With dead ends: 9598 [2022-12-14 13:43:30,592 INFO L226 Difference]: Without dead ends: 9598 [2022-12-14 13:43:30,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:30,592 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:30,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9598 states. [2022-12-14 13:43:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9598 to 9598. [2022-12-14 13:43:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9598 states, 9452 states have (on average 4.147587812103259) internal successors, (39203), 9597 states have internal predecessors, (39203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 39203 transitions. [2022-12-14 13:43:30,821 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 39203 transitions. Word has length 13 [2022-12-14 13:43:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:30,822 INFO L495 AbstractCegarLoop]: Abstraction has 9598 states and 39203 transitions. [2022-12-14 13:43:30,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 39203 transitions. [2022-12-14 13:43:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 13:43:30,823 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:30,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:30,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:43:30,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2036329910, now seen corresponding path program 1 times [2022-12-14 13:43:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:30,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365497417] [2022-12-14 13:43:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:30,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:30,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365497417] [2022-12-14 13:43:30,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365497417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:30,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:30,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:43:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299532157] [2022-12-14 13:43:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:30,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:43:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:43:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:30,966 INFO L87 Difference]: Start difference. First operand 9598 states and 39203 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:31,144 INFO L93 Difference]: Finished difference Result 9342 states and 38179 transitions. [2022-12-14 13:43:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 13:43:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:31,177 INFO L225 Difference]: With dead ends: 9342 [2022-12-14 13:43:31,178 INFO L226 Difference]: Without dead ends: 9342 [2022-12-14 13:43:31,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:31,178 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:31,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9342 states. [2022-12-14 13:43:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9342 to 9342. [2022-12-14 13:43:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9342 states, 9197 states have (on average 4.151244971186256) internal successors, (38179), 9341 states have internal predecessors, (38179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9342 states to 9342 states and 38179 transitions. [2022-12-14 13:43:31,428 INFO L78 Accepts]: Start accepts. Automaton has 9342 states and 38179 transitions. Word has length 14 [2022-12-14 13:43:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:31,429 INFO L495 AbstractCegarLoop]: Abstraction has 9342 states and 38179 transitions. [2022-12-14 13:43:31,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9342 states and 38179 transitions. [2022-12-14 13:43:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 13:43:31,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:31,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:31,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 13:43:31,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2036329909, now seen corresponding path program 1 times [2022-12-14 13:43:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:31,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534790494] [2022-12-14 13:43:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:31,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534790494] [2022-12-14 13:43:31,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534790494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:31,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:31,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:43:31,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760557657] [2022-12-14 13:43:31,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:31,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:43:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:43:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:43:31,820 INFO L87 Difference]: Start difference. First operand 9342 states and 38179 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:31,967 INFO L93 Difference]: Finished difference Result 9086 states and 37155 transitions. [2022-12-14 13:43:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:43:31,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 13:43:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:31,993 INFO L225 Difference]: With dead ends: 9086 [2022-12-14 13:43:31,993 INFO L226 Difference]: Without dead ends: 9086 [2022-12-14 13:43:31,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:43:31,994 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:31,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2022-12-14 13:43:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 9086. [2022-12-14 13:43:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9086 states, 8942 states have (on average 4.155110713486915) internal successors, (37155), 9085 states have internal predecessors, (37155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 37155 transitions. [2022-12-14 13:43:32,172 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 37155 transitions. Word has length 14 [2022-12-14 13:43:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:32,172 INFO L495 AbstractCegarLoop]: Abstraction has 9086 states and 37155 transitions. [2022-12-14 13:43:32,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 37155 transitions. [2022-12-14 13:43:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 13:43:32,173 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:32,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:32,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 13:43:32,174 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:32,174 INFO L85 PathProgramCache]: Analyzing trace with hash 115401203, now seen corresponding path program 1 times [2022-12-14 13:43:32,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:32,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447027241] [2022-12-14 13:43:32,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:32,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:32,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:32,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447027241] [2022-12-14 13:43:32,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447027241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:32,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:32,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:43:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809121215] [2022-12-14 13:43:32,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:32,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:43:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:32,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:43:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:32,285 INFO L87 Difference]: Start difference. First operand 9086 states and 37155 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:32,423 INFO L93 Difference]: Finished difference Result 9054 states and 37011 transitions. [2022-12-14 13:43:32,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 13:43:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:32,484 INFO L225 Difference]: With dead ends: 9054 [2022-12-14 13:43:32,484 INFO L226 Difference]: Without dead ends: 9054 [2022-12-14 13:43:32,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:32,485 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:32,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9054 states. [2022-12-14 13:43:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9054 to 9054. [2022-12-14 13:43:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9054 states, 8910 states have (on average 4.153872053872054) internal successors, (37011), 9053 states have internal predecessors, (37011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9054 states to 9054 states and 37011 transitions. [2022-12-14 13:43:32,653 INFO L78 Accepts]: Start accepts. Automaton has 9054 states and 37011 transitions. Word has length 14 [2022-12-14 13:43:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:32,654 INFO L495 AbstractCegarLoop]: Abstraction has 9054 states and 37011 transitions. [2022-12-14 13:43:32,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 9054 states and 37011 transitions. [2022-12-14 13:43:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 13:43:32,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:32,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:32,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:43:32,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -722161495, now seen corresponding path program 1 times [2022-12-14 13:43:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:32,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265471081] [2022-12-14 13:43:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:32,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:32,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:32,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265471081] [2022-12-14 13:43:32,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265471081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:32,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:32,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:43:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32353467] [2022-12-14 13:43:32,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:32,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:43:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:32,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:43:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:32,863 INFO L87 Difference]: Start difference. First operand 9054 states and 37011 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:33,009 INFO L93 Difference]: Finished difference Result 9042 states and 36958 transitions. [2022-12-14 13:43:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:33,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 13:43:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:33,039 INFO L225 Difference]: With dead ends: 9042 [2022-12-14 13:43:33,039 INFO L226 Difference]: Without dead ends: 9042 [2022-12-14 13:43:33,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:33,040 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:33,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9042 states. [2022-12-14 13:43:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9042 to 9042. [2022-12-14 13:43:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9042 states, 8898 states have (on average 4.1535176444144755) internal successors, (36958), 9041 states have internal predecessors, (36958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9042 states to 9042 states and 36958 transitions. [2022-12-14 13:43:33,228 INFO L78 Accepts]: Start accepts. Automaton has 9042 states and 36958 transitions. Word has length 15 [2022-12-14 13:43:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:33,229 INFO L495 AbstractCegarLoop]: Abstraction has 9042 states and 36958 transitions. [2022-12-14 13:43:33,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 9042 states and 36958 transitions. [2022-12-14 13:43:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:43:33,230 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:33,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:33,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 13:43:33,230 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1543486282, now seen corresponding path program 1 times [2022-12-14 13:43:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:33,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168282324] [2022-12-14 13:43:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:33,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:33,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168282324] [2022-12-14 13:43:33,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168282324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:33,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:33,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:43:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443507641] [2022-12-14 13:43:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:33,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:43:33,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:33,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:43:33,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:43:33,416 INFO L87 Difference]: Start difference. First operand 9042 states and 36958 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:33,644 INFO L93 Difference]: Finished difference Result 10386 states and 42566 transitions. [2022-12-14 13:43:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:43:33,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:43:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:33,717 INFO L225 Difference]: With dead ends: 10386 [2022-12-14 13:43:33,717 INFO L226 Difference]: Without dead ends: 10386 [2022-12-14 13:43:33,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:43:33,718 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 76 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:33,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 2 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10386 states. [2022-12-14 13:43:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10386 to 9150. [2022-12-14 13:43:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9150 states, 9006 states have (on average 4.152675993781923) internal successors, (37399), 9149 states have internal predecessors, (37399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9150 states to 9150 states and 37399 transitions. [2022-12-14 13:43:33,921 INFO L78 Accepts]: Start accepts. Automaton has 9150 states and 37399 transitions. Word has length 16 [2022-12-14 13:43:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:33,921 INFO L495 AbstractCegarLoop]: Abstraction has 9150 states and 37399 transitions. [2022-12-14 13:43:33,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 9150 states and 37399 transitions. [2022-12-14 13:43:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:43:33,923 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:33,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:33,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:43:33,923 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1587191936, now seen corresponding path program 1 times [2022-12-14 13:43:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:33,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033550677] [2022-12-14 13:43:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:34,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:34,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033550677] [2022-12-14 13:43:34,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033550677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:34,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:34,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:43:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195286452] [2022-12-14 13:43:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:34,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:43:34,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:43:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:34,071 INFO L87 Difference]: Start difference. First operand 9150 states and 37399 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:34,214 INFO L93 Difference]: Finished difference Result 9090 states and 37146 transitions. [2022-12-14 13:43:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:43:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:34,251 INFO L225 Difference]: With dead ends: 9090 [2022-12-14 13:43:34,251 INFO L226 Difference]: Without dead ends: 9090 [2022-12-14 13:43:34,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:34,252 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:34,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9090 states. [2022-12-14 13:43:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9090 to 9090. [2022-12-14 13:43:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9090 states, 8946 states have (on average 4.152246814218645) internal successors, (37146), 9089 states have internal predecessors, (37146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9090 states to 9090 states and 37146 transitions. [2022-12-14 13:43:34,433 INFO L78 Accepts]: Start accepts. Automaton has 9090 states and 37146 transitions. Word has length 16 [2022-12-14 13:43:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:34,433 INFO L495 AbstractCegarLoop]: Abstraction has 9090 states and 37146 transitions. [2022-12-14 13:43:34,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9090 states and 37146 transitions. [2022-12-14 13:43:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:43:34,435 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:34,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:34,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 13:43:34,435 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash -913852048, now seen corresponding path program 2 times [2022-12-14 13:43:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:34,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874480484] [2022-12-14 13:43:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:34,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:34,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874480484] [2022-12-14 13:43:34,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874480484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:34,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:34,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:43:34,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23717013] [2022-12-14 13:43:34,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:34,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:43:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:34,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:43:34,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:34,604 INFO L87 Difference]: Start difference. First operand 9090 states and 37146 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:34,775 INFO L93 Difference]: Finished difference Result 9054 states and 36999 transitions. [2022-12-14 13:43:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:34,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:43:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:34,806 INFO L225 Difference]: With dead ends: 9054 [2022-12-14 13:43:34,806 INFO L226 Difference]: Without dead ends: 9054 [2022-12-14 13:43:34,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:34,806 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:34,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:34,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9054 states. [2022-12-14 13:43:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9054 to 8946. [2022-12-14 13:43:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8946 states, 8802 states have (on average 4.153374233128834) internal successors, (36558), 8945 states have internal predecessors, (36558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8946 states to 8946 states and 36558 transitions. [2022-12-14 13:43:35,032 INFO L78 Accepts]: Start accepts. Automaton has 8946 states and 36558 transitions. Word has length 16 [2022-12-14 13:43:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:35,032 INFO L495 AbstractCegarLoop]: Abstraction has 8946 states and 36558 transitions. [2022-12-14 13:43:35,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8946 states and 36558 transitions. [2022-12-14 13:43:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:43:35,034 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:35,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:35,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 13:43:35,034 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash -768554437, now seen corresponding path program 1 times [2022-12-14 13:43:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:35,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382424543] [2022-12-14 13:43:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:35,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:35,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382424543] [2022-12-14 13:43:35,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382424543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:35,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:35,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:43:35,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321932834] [2022-12-14 13:43:35,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:35,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:43:35,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:35,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:43:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:35,161 INFO L87 Difference]: Start difference. First operand 8946 states and 36558 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:35,295 INFO L93 Difference]: Finished difference Result 5075 states and 17799 transitions. [2022-12-14 13:43:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:43:35,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:43:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:35,310 INFO L225 Difference]: With dead ends: 5075 [2022-12-14 13:43:35,310 INFO L226 Difference]: Without dead ends: 5075 [2022-12-14 13:43:35,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:43:35,311 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:35,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5075 states. [2022-12-14 13:43:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5075 to 5075. [2022-12-14 13:43:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 4955 states have (on average 3.5921291624621596) internal successors, (17799), 5074 states have internal predecessors, (17799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 17799 transitions. [2022-12-14 13:43:35,419 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 17799 transitions. Word has length 16 [2022-12-14 13:43:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:35,419 INFO L495 AbstractCegarLoop]: Abstraction has 5075 states and 17799 transitions. [2022-12-14 13:43:35,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 17799 transitions. [2022-12-14 13:43:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 13:43:35,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:35,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:35,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 13:43:35,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:35,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1696766727, now seen corresponding path program 1 times [2022-12-14 13:43:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:35,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885439206] [2022-12-14 13:43:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:35,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:35,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:35,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885439206] [2022-12-14 13:43:35,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885439206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:35,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:35,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:43:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049673547] [2022-12-14 13:43:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:35,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:43:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:35,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:43:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:35,600 INFO L87 Difference]: Start difference. First operand 5075 states and 17799 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:35,767 INFO L93 Difference]: Finished difference Result 8852 states and 30955 transitions. [2022-12-14 13:43:35,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:43:35,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 13:43:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:35,791 INFO L225 Difference]: With dead ends: 8852 [2022-12-14 13:43:35,791 INFO L226 Difference]: Without dead ends: 8852 [2022-12-14 13:43:35,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:43:35,792 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:35,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 5 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2022-12-14 13:43:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 5711. [2022-12-14 13:43:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 5591 states have (on average 3.5789661956716152) internal successors, (20010), 5710 states have internal predecessors, (20010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 20010 transitions. [2022-12-14 13:43:35,912 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 20010 transitions. Word has length 19 [2022-12-14 13:43:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:35,912 INFO L495 AbstractCegarLoop]: Abstraction has 5711 states and 20010 transitions. [2022-12-14 13:43:35,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 20010 transitions. [2022-12-14 13:43:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 13:43:35,914 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:35,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:35,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 13:43:35,915 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash 537398612, now seen corresponding path program 1 times [2022-12-14 13:43:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:35,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238226084] [2022-12-14 13:43:35,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:36,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:36,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238226084] [2022-12-14 13:43:36,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238226084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:36,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:36,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:43:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640786572] [2022-12-14 13:43:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:36,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:43:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:36,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:43:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:36,038 INFO L87 Difference]: Start difference. First operand 5711 states and 20010 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:36,183 INFO L93 Difference]: Finished difference Result 2275 states and 6606 transitions. [2022-12-14 13:43:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:43:36,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 13:43:36,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:36,186 INFO L225 Difference]: With dead ends: 2275 [2022-12-14 13:43:36,186 INFO L226 Difference]: Without dead ends: 2275 [2022-12-14 13:43:36,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:36,187 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:36,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2022-12-14 13:43:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2275. [2022-12-14 13:43:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2275 states, 2211 states have (on average 2.987788331071913) internal successors, (6606), 2274 states have internal predecessors, (6606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 6606 transitions. [2022-12-14 13:43:36,223 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 6606 transitions. Word has length 19 [2022-12-14 13:43:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:36,223 INFO L495 AbstractCegarLoop]: Abstraction has 2275 states and 6606 transitions. [2022-12-14 13:43:36,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 6606 transitions. [2022-12-14 13:43:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:43:36,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:36,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:36,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 13:43:36,225 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -398067822, now seen corresponding path program 1 times [2022-12-14 13:43:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:36,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168563176] [2022-12-14 13:43:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:38,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:38,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168563176] [2022-12-14 13:43:38,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168563176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:38,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:38,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 13:43:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150710325] [2022-12-14 13:43:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:38,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 13:43:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 13:43:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:43:38,035 INFO L87 Difference]: Start difference. First operand 2275 states and 6606 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:38,822 INFO L93 Difference]: Finished difference Result 3433 states and 10130 transitions. [2022-12-14 13:43:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:43:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:43:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:38,828 INFO L225 Difference]: With dead ends: 3433 [2022-12-14 13:43:38,828 INFO L226 Difference]: Without dead ends: 3433 [2022-12-14 13:43:38,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-12-14 13:43:38,828 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 144 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:38,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 39 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 13:43:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2022-12-14 13:43:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 2390. [2022-12-14 13:43:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2326 states have (on average 3.0030094582975067) internal successors, (6985), 2389 states have internal predecessors, (6985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 6985 transitions. [2022-12-14 13:43:38,860 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 6985 transitions. Word has length 21 [2022-12-14 13:43:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:38,860 INFO L495 AbstractCegarLoop]: Abstraction has 2390 states and 6985 transitions. [2022-12-14 13:43:38,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 6985 transitions. [2022-12-14 13:43:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:43:38,862 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:38,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:38,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 13:43:38,862 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash 162812466, now seen corresponding path program 2 times [2022-12-14 13:43:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:38,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389512079] [2022-12-14 13:43:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:41,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:41,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389512079] [2022-12-14 13:43:41,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389512079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:41,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:41,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 13:43:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874112733] [2022-12-14 13:43:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:41,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 13:43:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 13:43:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-14 13:43:41,857 INFO L87 Difference]: Start difference. First operand 2390 states and 6985 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:43,146 INFO L93 Difference]: Finished difference Result 3075 states and 9053 transitions. [2022-12-14 13:43:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 13:43:43,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:43:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:43,154 INFO L225 Difference]: With dead ends: 3075 [2022-12-14 13:43:43,154 INFO L226 Difference]: Without dead ends: 3075 [2022-12-14 13:43:43,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2022-12-14 13:43:43,155 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 127 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:43,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 38 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 13:43:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2022-12-14 13:43:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2390. [2022-12-14 13:43:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2326 states have (on average 3.0030094582975067) internal successors, (6985), 2389 states have internal predecessors, (6985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 6985 transitions. [2022-12-14 13:43:43,215 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 6985 transitions. Word has length 21 [2022-12-14 13:43:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:43,215 INFO L495 AbstractCegarLoop]: Abstraction has 2390 states and 6985 transitions. [2022-12-14 13:43:43,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 6985 transitions. [2022-12-14 13:43:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:43:43,218 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:43,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:43,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 13:43:43,218 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1101301434, now seen corresponding path program 1 times [2022-12-14 13:43:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:43,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842797030] [2022-12-14 13:43:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:43,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:43,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842797030] [2022-12-14 13:43:43,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842797030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:43,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:43,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:43:43,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793325379] [2022-12-14 13:43:43,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:43,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:43:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:43:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:43:43,508 INFO L87 Difference]: Start difference. First operand 2390 states and 6985 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:43,731 INFO L93 Difference]: Finished difference Result 5233 states and 14763 transitions. [2022-12-14 13:43:43,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:43:43,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:43:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:43,741 INFO L225 Difference]: With dead ends: 5233 [2022-12-14 13:43:43,741 INFO L226 Difference]: Without dead ends: 5233 [2022-12-14 13:43:43,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:43:43,742 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 69 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:43,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 9 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:43:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2022-12-14 13:43:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 2230. [2022-12-14 13:43:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2166 states have (on average 2.9916897506925206) internal successors, (6480), 2229 states have internal predecessors, (6480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 6480 transitions. [2022-12-14 13:43:43,799 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 6480 transitions. Word has length 21 [2022-12-14 13:43:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:43,799 INFO L495 AbstractCegarLoop]: Abstraction has 2230 states and 6480 transitions. [2022-12-14 13:43:43,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 6480 transitions. [2022-12-14 13:43:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:43:43,802 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:43,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:43,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 13:43:43,802 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1986993866, now seen corresponding path program 3 times [2022-12-14 13:43:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:43,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575663101] [2022-12-14 13:43:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:43,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:45,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:45,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575663101] [2022-12-14 13:43:45,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575663101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:45,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:45,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:43:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363151068] [2022-12-14 13:43:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:45,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:43:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:43:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:43:45,950 INFO L87 Difference]: Start difference. First operand 2230 states and 6480 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:46,402 INFO L93 Difference]: Finished difference Result 2576 states and 7521 transitions. [2022-12-14 13:43:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:43:46,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:43:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:46,406 INFO L225 Difference]: With dead ends: 2576 [2022-12-14 13:43:46,406 INFO L226 Difference]: Without dead ends: 2576 [2022-12-14 13:43:46,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:43:46,407 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 91 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:46,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 22 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:43:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2022-12-14 13:43:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2220. [2022-12-14 13:43:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 2156 states have (on average 2.991187384044527) internal successors, (6449), 2219 states have internal predecessors, (6449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 6449 transitions. [2022-12-14 13:43:46,433 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 6449 transitions. Word has length 21 [2022-12-14 13:43:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:46,433 INFO L495 AbstractCegarLoop]: Abstraction has 2220 states and 6449 transitions. [2022-12-14 13:43:46,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 6449 transitions. [2022-12-14 13:43:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 13:43:46,434 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:46,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:46,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 13:43:46,435 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash -589164660, now seen corresponding path program 1 times [2022-12-14 13:43:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:46,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490547101] [2022-12-14 13:43:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:46,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:46,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490547101] [2022-12-14 13:43:46,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490547101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:46,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:46,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:43:46,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700866509] [2022-12-14 13:43:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:46,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:43:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:46,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:43:46,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:43:46,630 INFO L87 Difference]: Start difference. First operand 2220 states and 6449 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:46,769 INFO L93 Difference]: Finished difference Result 2499 states and 6925 transitions. [2022-12-14 13:43:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:43:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 13:43:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:46,775 INFO L225 Difference]: With dead ends: 2499 [2022-12-14 13:43:46,775 INFO L226 Difference]: Without dead ends: 2451 [2022-12-14 13:43:46,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:43:46,776 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:46,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2022-12-14 13:43:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2288. [2022-12-14 13:43:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 2224 states have (on average 2.9446942446043165) internal successors, (6549), 2287 states have internal predecessors, (6549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 6549 transitions. [2022-12-14 13:43:46,818 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 6549 transitions. Word has length 22 [2022-12-14 13:43:46,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:46,818 INFO L495 AbstractCegarLoop]: Abstraction has 2288 states and 6549 transitions. [2022-12-14 13:43:46,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 6549 transitions. [2022-12-14 13:43:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 13:43:46,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:46,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:46,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 13:43:46,821 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:46,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1301890261, now seen corresponding path program 1 times [2022-12-14 13:43:46,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:46,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493243881] [2022-12-14 13:43:46,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:48,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:48,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493243881] [2022-12-14 13:43:48,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493243881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:48,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:48,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 13:43:48,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451867939] [2022-12-14 13:43:48,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 13:43:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 13:43:48,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:43:48,057 INFO L87 Difference]: Start difference. First operand 2288 states and 6549 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:48,914 INFO L93 Difference]: Finished difference Result 4082 states and 11687 transitions. [2022-12-14 13:43:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 13:43:48,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 13:43:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:48,923 INFO L225 Difference]: With dead ends: 4082 [2022-12-14 13:43:48,923 INFO L226 Difference]: Without dead ends: 4082 [2022-12-14 13:43:48,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-12-14 13:43:48,924 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:48,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 45 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 13:43:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2022-12-14 13:43:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 2469. [2022-12-14 13:43:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2405 states have (on average 2.973804573804574) internal successors, (7152), 2468 states have internal predecessors, (7152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 7152 transitions. [2022-12-14 13:43:48,985 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 7152 transitions. Word has length 22 [2022-12-14 13:43:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:48,985 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 7152 transitions. [2022-12-14 13:43:48,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 7152 transitions. [2022-12-14 13:43:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 13:43:48,988 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:48,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:48,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 13:43:48,989 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1346308642, now seen corresponding path program 1 times [2022-12-14 13:43:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:48,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801279105] [2022-12-14 13:43:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:49,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:49,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801279105] [2022-12-14 13:43:49,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801279105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:49,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:49,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:43:49,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105578056] [2022-12-14 13:43:49,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:49,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:43:49,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:49,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:43:49,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:43:49,227 INFO L87 Difference]: Start difference. First operand 2469 states and 7152 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:49,375 INFO L93 Difference]: Finished difference Result 1129 states and 3244 transitions. [2022-12-14 13:43:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:43:49,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 13:43:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:49,378 INFO L225 Difference]: With dead ends: 1129 [2022-12-14 13:43:49,378 INFO L226 Difference]: Without dead ends: 1129 [2022-12-14 13:43:49,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:43:49,378 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 36 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:49,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-12-14 13:43:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1125. [2022-12-14 13:43:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1107 states have (on average 2.919602529358627) internal successors, (3232), 1124 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 3232 transitions. [2022-12-14 13:43:49,397 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 3232 transitions. Word has length 22 [2022-12-14 13:43:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:49,397 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 3232 transitions. [2022-12-14 13:43:49,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 3232 transitions. [2022-12-14 13:43:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:43:49,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:49,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:49,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 13:43:49,400 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:49,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash 803283848, now seen corresponding path program 1 times [2022-12-14 13:43:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:49,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404142978] [2022-12-14 13:43:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:51,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:51,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404142978] [2022-12-14 13:43:51,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404142978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:51,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:51,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 13:43:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110243744] [2022-12-14 13:43:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 13:43:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:51,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 13:43:51,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:43:51,044 INFO L87 Difference]: Start difference. First operand 1125 states and 3232 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:51,560 INFO L93 Difference]: Finished difference Result 2739 states and 7603 transitions. [2022-12-14 13:43:51,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 13:43:51,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 13:43:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:51,566 INFO L225 Difference]: With dead ends: 2739 [2022-12-14 13:43:51,566 INFO L226 Difference]: Without dead ends: 2739 [2022-12-14 13:43:51,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-12-14 13:43:51,567 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 121 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:51,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 37 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:43:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2022-12-14 13:43:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 1205. [2022-12-14 13:43:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1187 states have (on average 2.9342881213142378) internal successors, (3483), 1204 states have internal predecessors, (3483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 3483 transitions. [2022-12-14 13:43:51,587 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 3483 transitions. Word has length 24 [2022-12-14 13:43:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:51,588 INFO L495 AbstractCegarLoop]: Abstraction has 1205 states and 3483 transitions. [2022-12-14 13:43:51,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 3483 transitions. [2022-12-14 13:43:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:43:51,589 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:51,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:51,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 13:43:51,589 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:51,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash 508058342, now seen corresponding path program 2 times [2022-12-14 13:43:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:51,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428838644] [2022-12-14 13:43:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:54,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:54,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428838644] [2022-12-14 13:43:54,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428838644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:54,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:54,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 13:43:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054909501] [2022-12-14 13:43:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:54,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 13:43:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 13:43:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-14 13:43:54,284 INFO L87 Difference]: Start difference. First operand 1205 states and 3483 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:55,752 INFO L93 Difference]: Finished difference Result 3005 states and 8556 transitions. [2022-12-14 13:43:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 13:43:55,753 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 13:43:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:55,758 INFO L225 Difference]: With dead ends: 3005 [2022-12-14 13:43:55,758 INFO L226 Difference]: Without dead ends: 3005 [2022-12-14 13:43:55,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-12-14 13:43:55,759 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 146 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:55,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 104 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 13:43:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2022-12-14 13:43:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1476. [2022-12-14 13:43:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1458 states have (on average 2.9574759945130316) internal successors, (4312), 1475 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4312 transitions. [2022-12-14 13:43:55,782 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4312 transitions. Word has length 24 [2022-12-14 13:43:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:55,782 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 4312 transitions. [2022-12-14 13:43:55,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4312 transitions. [2022-12-14 13:43:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:43:55,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:55,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:55,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 13:43:55,784 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash -101466266, now seen corresponding path program 3 times [2022-12-14 13:43:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:55,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670376706] [2022-12-14 13:43:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:56,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:56,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670376706] [2022-12-14 13:43:56,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670376706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:56,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:56,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:43:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400283544] [2022-12-14 13:43:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:56,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:43:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:43:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:43:56,027 INFO L87 Difference]: Start difference. First operand 1476 states and 4312 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:56,149 INFO L93 Difference]: Finished difference Result 1271 states and 3891 transitions. [2022-12-14 13:43:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:43:56,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 13:43:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:56,152 INFO L225 Difference]: With dead ends: 1271 [2022-12-14 13:43:56,152 INFO L226 Difference]: Without dead ends: 1271 [2022-12-14 13:43:56,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:43:56,153 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:56,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 8 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:43:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-12-14 13:43:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 868. [2022-12-14 13:43:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 866 states have (on average 3.0473441108545036) internal successors, (2639), 867 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2639 transitions. [2022-12-14 13:43:56,168 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2639 transitions. Word has length 24 [2022-12-14 13:43:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:56,168 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 2639 transitions. [2022-12-14 13:43:56,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:43:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2639 transitions. [2022-12-14 13:43:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:43:56,169 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:56,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:56,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 13:43:56,169 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:43:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash -493829761, now seen corresponding path program 1 times [2022-12-14 13:43:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:56,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610987891] [2022-12-14 13:43:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:58,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:58,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610987891] [2022-12-14 13:43:58,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610987891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:43:58,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:43:58,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 13:43:58,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711136101] [2022-12-14 13:43:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:43:58,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 13:43:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:58,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 13:43:58,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-14 13:43:58,870 INFO L87 Difference]: Start difference. First operand 868 states and 2639 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:44:01,007 INFO L93 Difference]: Finished difference Result 2434 states and 6870 transitions. [2022-12-14 13:44:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 13:44:01,007 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:44:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:44:01,011 INFO L225 Difference]: With dead ends: 2434 [2022-12-14 13:44:01,011 INFO L226 Difference]: Without dead ends: 2434 [2022-12-14 13:44:01,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2022-12-14 13:44:01,012 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 132 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 13:44:01,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 56 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 13:44:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2022-12-14 13:44:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 888. [2022-12-14 13:44:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 3.0575620767494356) internal successors, (2709), 887 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2709 transitions. [2022-12-14 13:44:01,030 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2709 transitions. Word has length 27 [2022-12-14 13:44:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:44:01,030 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 2709 transitions. [2022-12-14 13:44:01,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2709 transitions. [2022-12-14 13:44:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:44:01,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:44:01,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:44:01,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 13:44:01,032 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:44:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:44:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1268048607, now seen corresponding path program 2 times [2022-12-14 13:44:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:44:01,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263496925] [2022-12-14 13:44:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:44:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:44:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:44:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:44:02,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:44:02,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263496925] [2022-12-14 13:44:02,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263496925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:44:02,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:44:02,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 13:44:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921192035] [2022-12-14 13:44:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:44:02,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 13:44:02,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:44:02,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 13:44:02,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:44:02,731 INFO L87 Difference]: Start difference. First operand 888 states and 2709 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:44:03,392 INFO L93 Difference]: Finished difference Result 2392 states and 6812 transitions. [2022-12-14 13:44:03,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 13:44:03,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:44:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:44:03,395 INFO L225 Difference]: With dead ends: 2392 [2022-12-14 13:44:03,396 INFO L226 Difference]: Without dead ends: 2392 [2022-12-14 13:44:03,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-12-14 13:44:03,396 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 130 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:44:03,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 39 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:44:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2022-12-14 13:44:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 856. [2022-12-14 13:44:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 854 states have (on average 3.0456674473067915) internal successors, (2601), 855 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 2601 transitions. [2022-12-14 13:44:03,412 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 2601 transitions. Word has length 27 [2022-12-14 13:44:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:44:03,412 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 2601 transitions. [2022-12-14 13:44:03,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 2601 transitions. [2022-12-14 13:44:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:44:03,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:44:03,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:44:03,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 13:44:03,413 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:44:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:44:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1852027743, now seen corresponding path program 3 times [2022-12-14 13:44:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:44:03,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118669760] [2022-12-14 13:44:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:44:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:44:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:44:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:44:06,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:44:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118669760] [2022-12-14 13:44:06,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118669760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:44:06,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:44:06,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 13:44:06,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54239685] [2022-12-14 13:44:06,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:44:06,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 13:44:06,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:44:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 13:44:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-14 13:44:06,799 INFO L87 Difference]: Start difference. First operand 856 states and 2601 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:44:08,329 INFO L93 Difference]: Finished difference Result 2365 states and 6934 transitions. [2022-12-14 13:44:08,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 13:44:08,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:44:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:44:08,333 INFO L225 Difference]: With dead ends: 2365 [2022-12-14 13:44:08,333 INFO L226 Difference]: Without dead ends: 2365 [2022-12-14 13:44:08,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-12-14 13:44:08,333 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 93 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:44:08,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 83 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 13:44:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2022-12-14 13:44:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 892. [2022-12-14 13:44:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 890 states have (on average 3.0640449438202246) internal successors, (2727), 891 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2727 transitions. [2022-12-14 13:44:08,349 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2727 transitions. Word has length 27 [2022-12-14 13:44:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:44:08,349 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 2727 transitions. [2022-12-14 13:44:08,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2727 transitions. [2022-12-14 13:44:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:44:08,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:44:08,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:44:08,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 13:44:08,351 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:44:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:44:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 861525039, now seen corresponding path program 4 times [2022-12-14 13:44:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:44:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424712698] [2022-12-14 13:44:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:44:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:44:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:44:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:44:11,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:44:11,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424712698] [2022-12-14 13:44:11,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424712698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:44:11,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:44:11,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 13:44:11,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783526770] [2022-12-14 13:44:11,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:44:11,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 13:44:11,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:44:11,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 13:44:11,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 13:44:11,667 INFO L87 Difference]: Start difference. First operand 892 states and 2727 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:44:12,638 INFO L93 Difference]: Finished difference Result 1463 states and 4440 transitions. [2022-12-14 13:44:12,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:44:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:44:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:44:12,641 INFO L225 Difference]: With dead ends: 1463 [2022-12-14 13:44:12,641 INFO L226 Difference]: Without dead ends: 1463 [2022-12-14 13:44:12,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-14 13:44:12,642 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 91 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 13:44:12,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 73 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 13:44:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-12-14 13:44:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 892. [2022-12-14 13:44:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 890 states have (on average 3.0640449438202246) internal successors, (2727), 891 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2727 transitions. [2022-12-14 13:44:12,654 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2727 transitions. Word has length 27 [2022-12-14 13:44:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:44:12,654 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 2727 transitions. [2022-12-14 13:44:12,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2727 transitions. [2022-12-14 13:44:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:44:12,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:44:12,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:44:12,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 13:44:12,656 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:44:12,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:44:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1713380917, now seen corresponding path program 5 times [2022-12-14 13:44:12,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:44:12,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135637265] [2022-12-14 13:44:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:44:12,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:44:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:44:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:44:16,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:44:16,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135637265] [2022-12-14 13:44:16,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135637265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:44:16,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:44:16,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 13:44:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535462978] [2022-12-14 13:44:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:44:16,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 13:44:16,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:44:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 13:44:16,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-14 13:44:16,175 INFO L87 Difference]: Start difference. First operand 892 states and 2727 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:44:17,752 INFO L93 Difference]: Finished difference Result 2655 states and 7606 transitions. [2022-12-14 13:44:17,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:44:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:44:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:44:17,756 INFO L225 Difference]: With dead ends: 2655 [2022-12-14 13:44:17,756 INFO L226 Difference]: Without dead ends: 2655 [2022-12-14 13:44:17,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-14 13:44:17,757 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 133 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 13:44:17,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 43 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 13:44:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2022-12-14 13:44:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 858. [2022-12-14 13:44:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 856 states have (on average 3.0478971962616823) internal successors, (2609), 857 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2609 transitions. [2022-12-14 13:44:17,774 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 2609 transitions. Word has length 27 [2022-12-14 13:44:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:44:17,774 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 2609 transitions. [2022-12-14 13:44:17,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:44:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 2609 transitions. [2022-12-14 13:44:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:44:17,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:44:17,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:44:17,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 13:44:17,775 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:44:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:44:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1957447903, now seen corresponding path program 6 times [2022-12-14 13:44:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:44:17,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892444418] [2022-12-14 13:44:17,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:44:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:44:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:44:17,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 13:44:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:44:17,981 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 13:44:17,981 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 13:44:17,981 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (101 of 102 remaining) [2022-12-14 13:44:17,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 102 remaining) [2022-12-14 13:44:17,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 102 remaining) [2022-12-14 13:44:17,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 102 remaining) [2022-12-14 13:44:17,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 102 remaining) [2022-12-14 13:44:17,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 102 remaining) [2022-12-14 13:44:17,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (88 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 102 remaining) [2022-12-14 13:44:17,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 102 remaining) [2022-12-14 13:44:17,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 102 remaining) [2022-12-14 13:44:17,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 102 remaining) [2022-12-14 13:44:17,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (45 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 102 remaining) [2022-12-14 13:44:17,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 102 remaining) [2022-12-14 13:44:17,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 102 remaining) [2022-12-14 13:44:17,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 102 remaining) [2022-12-14 13:44:17,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 102 remaining) [2022-12-14 13:44:17,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 102 remaining) [2022-12-14 13:44:17,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 102 remaining) [2022-12-14 13:44:17,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 102 remaining) [2022-12-14 13:44:17,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 102 remaining) [2022-12-14 13:44:17,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 13:44:17,994 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:44:17,998 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 13:44:17,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:44:18,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:44:18 BasicIcfg [2022-12-14 13:44:18,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:44:18,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:44:18,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:44:18,059 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:44:18,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:42:54" (3/4) ... [2022-12-14 13:44:18,061 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 13:44:18,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:44:18,061 INFO L158 Benchmark]: Toolchain (without parser) took 85504.94ms. Allocated memory was 174.1MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 111.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 8.7GB. Max. memory is 16.1GB. [2022-12-14 13:44:18,061 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 102.8MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:44:18,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.89ms. Allocated memory is still 174.1MB. Free memory was 110.9MB in the beginning and 81.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-14 13:44:18,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.93ms. Allocated memory is still 174.1MB. Free memory was 81.5MB in the beginning and 145.2MB in the end (delta: -63.6MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-12-14 13:44:18,062 INFO L158 Benchmark]: Boogie Preprocessor took 29.64ms. Allocated memory is still 174.1MB. Free memory was 145.2MB in the beginning and 142.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:44:18,062 INFO L158 Benchmark]: RCFGBuilder took 1029.81ms. Allocated memory is still 174.1MB. Free memory was 142.4MB in the beginning and 65.4MB in the end (delta: 77.0MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2022-12-14 13:44:18,062 INFO L158 Benchmark]: TraceAbstraction took 83942.90ms. Allocated memory was 174.1MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 64.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 8.6GB. Max. memory is 16.1GB. [2022-12-14 13:44:18,062 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 10.7GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:44:18,063 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 102.8MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.89ms. Allocated memory is still 174.1MB. Free memory was 110.9MB in the beginning and 81.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.93ms. Allocated memory is still 174.1MB. Free memory was 81.5MB in the beginning and 145.2MB in the end (delta: -63.6MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.64ms. Allocated memory is still 174.1MB. Free memory was 145.2MB in the beginning and 142.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1029.81ms. Allocated memory is still 174.1MB. Free memory was 142.4MB in the beginning and 65.4MB in the end (delta: 77.0MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * TraceAbstraction took 83942.90ms. Allocated memory was 174.1MB in the beginning and 10.7GB in the end (delta: 10.5GB). Free memory was 64.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 8.6GB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 10.7GB. Free memory is still 2.0GB. 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: 15.8s, 221 PlacesBefore, 105 PlacesAfterwards, 210 TransitionsBefore, 93 TransitionsAfterwards, 10744 CoEnabledTransitionPairs, 8 FixpointIterations, 75 TrivialSequentialCompositions, 117 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 199 TotalNumberOfCompositions, 49406 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18306, independent: 17642, independent conditional: 0, independent unconditional: 17642, dependent: 440, dependent conditional: 0, dependent unconditional: 440, unknown: 224, unknown conditional: 0, unknown unconditional: 224] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6405, independent: 6294, independent conditional: 0, independent unconditional: 6294, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6405, independent: 5588, independent conditional: 0, independent unconditional: 5588, dependent: 817, dependent conditional: 0, dependent unconditional: 817, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 817, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3042, independent: 2378, independent conditional: 0, independent unconditional: 2378, dependent: 310, dependent conditional: 0, dependent unconditional: 310, unknown: 355, unknown conditional: 0, unknown unconditional: 355] ], Cache Queries: [ total: 18306, independent: 11348, independent conditional: 0, independent unconditional: 11348, dependent: 359, dependent conditional: 0, dependent unconditional: 359, unknown: 6599, unknown conditional: 0, unknown unconditional: 6599] , Statistics on independence cache: Total cache size (in pairs): 949, Positive cache size: 912, Positive conditional cache size: 0, Positive unconditional cache size: 912, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 20, Unknown conditional cache size: 0, Unknown unconditional cache size: 20 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L882] 0 pthread_t t2229; [L883] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2229, ((void *)0), P0, ((void *)0))=-4, t2229={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L884] 0 pthread_t t2230; [L885] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2230, ((void *)0), P1, ((void *)0))=-3, t2229={7:0}, t2230={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 2 x$w_buff1 = x$w_buff0 [L795] 2 x$w_buff0 = 1 [L796] 2 x$w_buff1_used = x$w_buff0_used [L797] 2 x$w_buff0_used = (_Bool)1 [L798] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L798] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L799] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L800] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L801] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L802] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L803] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L804] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2231; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={7:0}, t2230={8:0}, t2231={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L887] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2231, ((void *)0), P2, ((void *)0))=-2, t2229={7:0}, t2230={8:0}, t2231={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 3 x$flush_delayed = weak$$choice2 [L824] EXPR 3 \read(x) [L824] 3 x$mem_tmp = x [L825] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L827] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L828] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L829] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L830] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L831] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L834] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L835] EXPR 3 \read(x) [L835] 3 __unbuffered_p2_EAX = x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] 3 x = x$flush_delayed ? x$mem_tmp : x [L837] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2232; [L889] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2232, ((void *)0), P3, ((void *)0))=-1, t2229={7:0}, t2230={8:0}, t2231={9:0}, t2232={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 \read(x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L844] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L845] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L846] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L847] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L857] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L807] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L808] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L809] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L810] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L811] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 2 return 0; [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 \read(x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L861] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L862] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L863] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L864] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L869] 4 return 0; [L850] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L852] 3 return 0; [L891] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L893] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L893] RET 0 assume_abort_if_not(main$tmp_guard0) [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L896] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L897] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L898] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L899] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={7:0}, t2230={8:0}, t2231={9:0}, t2232={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L902] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L904] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L906] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 880]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 889]: 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: 887]: 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: 885]: 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: 883]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 283 locations, 102 error locations. Started 1 CEGAR loops. OverallTime: 83.7s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.6s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2029 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2029 mSDsluCounter, 660 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9749 IncrementalHoareTripleChecker+Invalid, 10327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 146 mSDtfsCounter, 9749 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479588occurred in iteration=0, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 21741 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 514 ConstructedInterpolants, 0 QuantifiedInterpolants, 12571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 13:44:18,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57c8b47d74ada5c94291d16aafebbb644062493fff61510a323122bcd88ba5b1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 13:44:20,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:44:20,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:44:20,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:44:20,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:44:20,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:44:20,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:44:20,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:44:20,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:44:20,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:44:20,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:44:20,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:44:20,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:44:20,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:44:20,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:44:20,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:44:20,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:44:20,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:44:20,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:44:20,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:44:20,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:44:20,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:44:20,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:44:20,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:44:20,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:44:20,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:44:20,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:44:20,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:44:20,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:44:20,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:44:20,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:44:20,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:44:20,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:44:20,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:44:20,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:44:20,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:44:20,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:44:20,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:44:20,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:44:20,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:44:20,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:44:20,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 13:44:20,161 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:44:20,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:44:20,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:44:20,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:44:20,162 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:44:20,162 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:44:20,162 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:44:20,163 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:44:20,163 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:44:20,163 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:44:20,163 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:44:20,163 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:44:20,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 13:44:20,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 13:44:20,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:44:20,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:44:20,164 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 13:44:20,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:44:20,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:44:20,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:44:20,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 13:44:20,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:44:20,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:44:20,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:44:20,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:44:20,166 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 13:44:20,166 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 13:44:20,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:44:20,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 13:44:20,167 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 57c8b47d74ada5c94291d16aafebbb644062493fff61510a323122bcd88ba5b1 [2022-12-14 13:44:20,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:44:20,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:44:20,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:44:20,439 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:44:20,440 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:44:20,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2022-12-14 13:44:22,956 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:44:23,160 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:44:23,161 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2022-12-14 13:44:23,171 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/data/9d6ee88a2/610ba76515344a23bf0cfacba69f0644/FLAGd52a55070 [2022-12-14 13:44:23,182 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/data/9d6ee88a2/610ba76515344a23bf0cfacba69f0644 [2022-12-14 13:44:23,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:44:23,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:44:23,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:44:23,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:44:23,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:44:23,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2ce53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23, skipping insertion in model container [2022-12-14 13:44:23,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:44:23,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:44:23,337 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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i[994,1007] [2022-12-14 13:44:23,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:44:23,541 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:44:23,562 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_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i[994,1007] [2022-12-14 13:44:23,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:44:23,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:44:23,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:44:23,663 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:44:23,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23 WrapperNode [2022-12-14 13:44:23,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:44:23,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:44:23,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:44:23,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:44:23,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,715 INFO L138 Inliner]: procedures = 181, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-12-14 13:44:23,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:44:23,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:44:23,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:44:23,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:44:23,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:44:23,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:44:23,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:44:23,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:44:23,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (1/1) ... [2022-12-14 13:44:23,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:44:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:44:23,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:44:23,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:44:23,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 13:44:23,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 13:44:23,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:44:23,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 13:44:23,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 13:44:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 13:44:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 13:44:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-14 13:44:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 13:44:23,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 13:44:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 13:44:23,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 13:44:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 13:44:23,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 13:44:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 13:44:23,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 13:44:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 13:44:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:44:23,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:44:23,822 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 13:44:23,948 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:44:23,950 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:44:24,536 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:44:24,946 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:44:24,946 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 13:44:24,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:24 BoogieIcfgContainer [2022-12-14 13:44:24,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:44:24,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:44:24,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:44:24,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:44:24,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:44:23" (1/3) ... [2022-12-14 13:44:24,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a47aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:24, skipping insertion in model container [2022-12-14 13:44:24,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:23" (2/3) ... [2022-12-14 13:44:24,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a47aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:24, skipping insertion in model container [2022-12-14 13:44:24,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:24" (3/3) ... [2022-12-14 13:44:24,956 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2022-12-14 13:44:24,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:44:24,971 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-12-14 13:44:24,971 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 13:44:25,128 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 13:44:25,151 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 13:44:25,161 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 211 transitions, 442 flow [2022-12-14 13:44:25,163 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 211 transitions, 442 flow [2022-12-14 13:44:25,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 211 transitions, 442 flow [2022-12-14 13:44:25,243 INFO L130 PetriNetUnfolder]: 2/207 cut-off events. [2022-12-14 13:44:25,243 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 13:44:25,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 2/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 344 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2022-12-14 13:44:25,253 INFO L119 LiptonReduction]: Number of co-enabled transitions 10744 [2022-12-14 13:44:48,329 WARN L233 SmtUtils]: Spent 7.03s on a formula simplification. DAG size of input: 276 DAG size of output: 274 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 13:44:59,643 INFO L134 LiptonReduction]: Checked pairs total: 48730 [2022-12-14 13:44:59,644 INFO L136 LiptonReduction]: Total number of compositions: 196 [2022-12-14 13:44:59,650 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 93 transitions, 206 flow [2022-12-14 13:45:09,425 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:09,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:45:09,450 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=FINITE_AUTOMATA, 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;@78de4f88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:45:09,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2022-12-14 13:45:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 13:45:10,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:10,012 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 13:45:10,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:10,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1321, now seen corresponding path program 1 times [2022-12-14 13:45:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:10,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150892638] [2022-12-14 13:45:10,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:10,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:10,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:10,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:10,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 13:45:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:10,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 13:45:10,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:10,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:10,226 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:10,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150892638] [2022-12-14 13:45:10,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150892638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:10,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:10,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 13:45:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897020045] [2022-12-14 13:45:10,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:10,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 13:45:10,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 13:45:10,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:45:10,910 INFO L87 Difference]: Start difference. First operand has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:12,691 INFO L93 Difference]: Finished difference Result 77980 states and 344739 transitions. [2022-12-14 13:45:12,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 13:45:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-12-14 13:45:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:13,252 INFO L225 Difference]: With dead ends: 77980 [2022-12-14 13:45:13,252 INFO L226 Difference]: Without dead ends: 77980 [2022-12-14 13:45:13,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:45:13,255 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:13,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:45:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77980 states. [2022-12-14 13:45:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77980 to 77980. [2022-12-14 13:45:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77980 states, 72311 states have (on average 4.767448935846551) internal successors, (344739), 77979 states have internal predecessors, (344739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77980 states to 77980 states and 344739 transitions. [2022-12-14 13:45:16,180 INFO L78 Accepts]: Start accepts. Automaton has 77980 states and 344739 transitions. Word has length 1 [2022-12-14 13:45:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:16,180 INFO L495 AbstractCegarLoop]: Abstraction has 77980 states and 344739 transitions. [2022-12-14 13:45:16,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 77980 states and 344739 transitions. [2022-12-14 13:45:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 13:45:16,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:16,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 13:45:16,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:45:16,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:16,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 40414918, now seen corresponding path program 1 times [2022-12-14 13:45:16,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:16,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793939116] [2022-12-14 13:45:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:16,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:16,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 13:45:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:16,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 13:45:16,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:16,725 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 13:45:16,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 13:45:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:16,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:16,758 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:16,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793939116] [2022-12-14 13:45:16,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793939116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:16,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:16,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:45:16,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049028811] [2022-12-14 13:45:16,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:16,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:45:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:45:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:45:16,760 INFO L87 Difference]: Start difference. First operand 77980 states and 344739 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:17,359 INFO L93 Difference]: Finished difference Result 39826 states and 171519 transitions. [2022-12-14 13:45:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:45:17,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 13:45:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:17,566 INFO L225 Difference]: With dead ends: 39826 [2022-12-14 13:45:17,566 INFO L226 Difference]: Without dead ends: 39826 [2022-12-14 13:45:17,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:45:17,567 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:17,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:45:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39826 states. [2022-12-14 13:45:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39826 to 39826. [2022-12-14 13:45:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39826 states, 38087 states have (on average 4.503347598918266) internal successors, (171519), 39825 states have internal predecessors, (171519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39826 states to 39826 states and 171519 transitions. [2022-12-14 13:45:18,758 INFO L78 Accepts]: Start accepts. Automaton has 39826 states and 171519 transitions. Word has length 4 [2022-12-14 13:45:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:18,759 INFO L495 AbstractCegarLoop]: Abstraction has 39826 states and 171519 transitions. [2022-12-14 13:45:18,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39826 states and 171519 transitions. [2022-12-14 13:45:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 13:45:18,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:18,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 13:45:18,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 13:45:18,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:18,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:18,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash 40414919, now seen corresponding path program 1 times [2022-12-14 13:45:18,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:18,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492296814] [2022-12-14 13:45:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:18,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:18,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:18,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:18,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 13:45:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:19,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 13:45:19,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:19,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:45:19,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 13:45:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:19,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:19,271 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:19,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492296814] [2022-12-14 13:45:19,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492296814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:19,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:19,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:45:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96318521] [2022-12-14 13:45:19,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:19,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:45:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:19,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:45:19,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:45:19,273 INFO L87 Difference]: Start difference. First operand 39826 states and 171519 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:19,492 INFO L93 Difference]: Finished difference Result 11558 states and 47571 transitions. [2022-12-14 13:45:19,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:45:19,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 13:45:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:19,549 INFO L225 Difference]: With dead ends: 11558 [2022-12-14 13:45:19,549 INFO L226 Difference]: Without dead ends: 11558 [2022-12-14 13:45:19,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:45:19,550 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:19,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:45:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11558 states. [2022-12-14 13:45:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11558 to 11558. [2022-12-14 13:45:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11558 states, 11361 states have (on average 4.187219434908899) internal successors, (47571), 11557 states have internal predecessors, (47571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11558 states to 11558 states and 47571 transitions. [2022-12-14 13:45:19,887 INFO L78 Accepts]: Start accepts. Automaton has 11558 states and 47571 transitions. Word has length 4 [2022-12-14 13:45:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:19,888 INFO L495 AbstractCegarLoop]: Abstraction has 11558 states and 47571 transitions. [2022-12-14 13:45:19,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 11558 states and 47571 transitions. [2022-12-14 13:45:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 13:45:19,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:19,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 13:45:19,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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-12-14 13:45:20,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:20,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash 185147547, now seen corresponding path program 1 times [2022-12-14 13:45:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:20,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116357143] [2022-12-14 13:45:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:20,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:20,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:20,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:20,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 13:45:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:20,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 13:45:20,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:20,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:20,265 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:20,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116357143] [2022-12-14 13:45:20,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116357143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:20,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:20,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:45:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402383380] [2022-12-14 13:45:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:20,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:45:20,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:45:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:45:20,267 INFO L87 Difference]: Start difference. First operand 11558 states and 47571 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:20,577 INFO L93 Difference]: Finished difference Result 9726 states and 39747 transitions. [2022-12-14 13:45:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:45:20,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 13:45:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:20,609 INFO L225 Difference]: With dead ends: 9726 [2022-12-14 13:45:20,610 INFO L226 Difference]: Without dead ends: 9726 [2022-12-14 13:45:20,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:45:20,610 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:20,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:45:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9726 states. [2022-12-14 13:45:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9726 to 9726. [2022-12-14 13:45:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9726 states, 9580 states have (on average 4.148956158663883) internal successors, (39747), 9725 states have internal predecessors, (39747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9726 states to 9726 states and 39747 transitions. [2022-12-14 13:45:20,817 INFO L78 Accepts]: Start accepts. Automaton has 9726 states and 39747 transitions. Word has length 6 [2022-12-14 13:45:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:20,817 INFO L495 AbstractCegarLoop]: Abstraction has 9726 states and 39747 transitions. [2022-12-14 13:45:20,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 9726 states and 39747 transitions. [2022-12-14 13:45:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 13:45:20,819 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:20,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:45:20,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 13:45:21,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:21,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:21,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:21,022 INFO L85 PathProgramCache]: Analyzing trace with hash -442467787, now seen corresponding path program 1 times [2022-12-14 13:45:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:21,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881968601] [2022-12-14 13:45:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:21,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:21,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:21,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 13:45:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:21,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 13:45:21,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:21,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:21,271 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:21,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881968601] [2022-12-14 13:45:21,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881968601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:21,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:21,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:45:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888666798] [2022-12-14 13:45:21,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:21,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:45:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:45:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:45:21,273 INFO L87 Difference]: Start difference. First operand 9726 states and 39747 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:21,476 INFO L93 Difference]: Finished difference Result 5579 states and 19608 transitions. [2022-12-14 13:45:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:45:21,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 13:45:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:21,493 INFO L225 Difference]: With dead ends: 5579 [2022-12-14 13:45:21,493 INFO L226 Difference]: Without dead ends: 5579 [2022-12-14 13:45:21,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:45:21,494 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:21,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:45:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2022-12-14 13:45:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 5579. [2022-12-14 13:45:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5579 states, 5457 states have (on average 3.593183067619571) internal successors, (19608), 5578 states have internal predecessors, (19608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 19608 transitions. [2022-12-14 13:45:21,599 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 19608 transitions. Word has length 13 [2022-12-14 13:45:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:21,599 INFO L495 AbstractCegarLoop]: Abstraction has 5579 states and 19608 transitions. [2022-12-14 13:45:21,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 19608 transitions. [2022-12-14 13:45:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:45:21,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:21,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:45:21,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 13:45:21,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:21,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1877881632, now seen corresponding path program 1 times [2022-12-14 13:45:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:21,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891255737] [2022-12-14 13:45:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:21,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:21,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:21,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 13:45:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:22,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:45:22,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:22,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:22,102 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:22,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891255737] [2022-12-14 13:45:22,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891255737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:22,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:22,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:45:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531875395] [2022-12-14 13:45:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:22,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:45:22,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:22,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:45:22,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:45:22,103 INFO L87 Difference]: Start difference. First operand 5579 states and 19608 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:22,334 INFO L93 Difference]: Finished difference Result 1998 states and 5716 transitions. [2022-12-14 13:45:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:45:22,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:45:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:22,337 INFO L225 Difference]: With dead ends: 1998 [2022-12-14 13:45:22,337 INFO L226 Difference]: Without dead ends: 1998 [2022-12-14 13:45:22,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:45:22,338 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:22,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:45:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2022-12-14 13:45:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1998. [2022-12-14 13:45:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1932 states have (on average 2.958592132505176) internal successors, (5716), 1997 states have internal predecessors, (5716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 5716 transitions. [2022-12-14 13:45:22,363 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 5716 transitions. Word has length 16 [2022-12-14 13:45:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:22,363 INFO L495 AbstractCegarLoop]: Abstraction has 1998 states and 5716 transitions. [2022-12-14 13:45:22,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 5716 transitions. [2022-12-14 13:45:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 13:45:22,365 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:22,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:45:22,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 13:45:22,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:22,566 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash -843437566, now seen corresponding path program 1 times [2022-12-14 13:45:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:22,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707143353] [2022-12-14 13:45:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:22,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:22,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:22,569 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:22,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 13:45:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:22,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 13:45:22,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:22,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:22,862 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:22,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707143353] [2022-12-14 13:45:22,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707143353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:22,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:22,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:45:22,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022642390] [2022-12-14 13:45:22,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:22,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:45:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:22,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:45:22,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:45:22,863 INFO L87 Difference]: Start difference. First operand 1998 states and 5716 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:23,210 INFO L93 Difference]: Finished difference Result 811 states and 2267 transitions. [2022-12-14 13:45:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:45:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 13:45:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:23,212 INFO L225 Difference]: With dead ends: 811 [2022-12-14 13:45:23,212 INFO L226 Difference]: Without dead ends: 811 [2022-12-14 13:45:23,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:45:23,212 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:23,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 13 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:45:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-12-14 13:45:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2022-12-14 13:45:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 791 states have (on average 2.865992414664981) internal successors, (2267), 810 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2267 transitions. [2022-12-14 13:45:23,222 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2267 transitions. Word has length 19 [2022-12-14 13:45:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:23,222 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 2267 transitions. [2022-12-14 13:45:23,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2267 transitions. [2022-12-14 13:45:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 13:45:23,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:23,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:45:23,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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-12-14 13:45:23,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:23,425 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1446641509, now seen corresponding path program 1 times [2022-12-14 13:45:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:23,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431047123] [2022-12-14 13:45:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:23,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:23,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:23,431 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:23,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 13:45:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:23,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 13:45:23,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:23,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:23,674 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:23,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431047123] [2022-12-14 13:45:23,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431047123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:23,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:23,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:45:23,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97035800] [2022-12-14 13:45:23,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:23,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:45:23,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:45:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:45:23,675 INFO L87 Difference]: Start difference. First operand 811 states and 2267 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:24,187 INFO L93 Difference]: Finished difference Result 632 states and 1921 transitions. [2022-12-14 13:45:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:45:24,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 13:45:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:24,189 INFO L225 Difference]: With dead ends: 632 [2022-12-14 13:45:24,189 INFO L226 Difference]: Without dead ends: 632 [2022-12-14 13:45:24,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:45:24,189 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:24,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 21 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 13:45:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-12-14 13:45:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2022-12-14 13:45:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 628 states have (on average 3.0589171974522293) internal successors, (1921), 631 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1921 transitions. [2022-12-14 13:45:24,197 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1921 transitions. Word has length 22 [2022-12-14 13:45:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:24,198 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1921 transitions. [2022-12-14 13:45:24,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1921 transitions. [2022-12-14 13:45:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 13:45:24,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:24,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:45:24,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-14 13:45:24,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:24,401 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2001382095, now seen corresponding path program 1 times [2022-12-14 13:45:24,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:24,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593032464] [2022-12-14 13:45:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:24,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:24,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:24,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 13:45:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:24,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 13:45:24,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:45:38,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 13:45:38,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 13:45:38,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 267 [2022-12-14 13:45:38,727 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 13:45:38,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-12-14 13:45:38,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 13:45:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:45:38,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:45:38,880 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:45:38,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593032464] [2022-12-14 13:45:38,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593032464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:45:38,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:45:38,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:45:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796383844] [2022-12-14 13:45:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:45:38,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:45:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:45:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:45:38,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:45:38,882 INFO L87 Difference]: Start difference. First operand 632 states and 1921 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:45:39,106 INFO L93 Difference]: Finished difference Result 631 states and 1920 transitions. [2022-12-14 13:45:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:45:39,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 13:45:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:45:39,108 INFO L225 Difference]: With dead ends: 631 [2022-12-14 13:45:39,109 INFO L226 Difference]: Without dead ends: 631 [2022-12-14 13:45:39,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:45:39,109 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:45:39,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:45:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-12-14 13:45:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2022-12-14 13:45:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 628 states have (on average 3.0573248407643314) internal successors, (1920), 630 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1920 transitions. [2022-12-14 13:45:39,124 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1920 transitions. Word has length 26 [2022-12-14 13:45:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:45:39,124 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 1920 transitions. [2022-12-14 13:45:39,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:45:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1920 transitions. [2022-12-14 13:45:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 13:45:39,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:45:39,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:45:39,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-14 13:45:39,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:39,328 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:45:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:45:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2001382094, now seen corresponding path program 1 times [2022-12-14 13:45:39,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:45:39,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110742437] [2022-12-14 13:45:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:45:39,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:45:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:45:39,335 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:45:39,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 13:45:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:45:39,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 13:45:39,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:46:36,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 288 [2022-12-14 13:46:36,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 282 [2022-12-14 13:46:36,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 13:46:36,201 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 13:46:36,202 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 13:46:36,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 13:46:36,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-12-14 13:46:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:46:36,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:46:36,329 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:46:36,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110742437] [2022-12-14 13:46:36,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110742437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:46:36,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:46:36,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:46:36,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841332363] [2022-12-14 13:46:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:46:36,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:46:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:46:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:46:36,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:46:36,330 INFO L87 Difference]: Start difference. First operand 631 states and 1920 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:46:36,514 INFO L93 Difference]: Finished difference Result 630 states and 1919 transitions. [2022-12-14 13:46:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:46:36,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 13:46:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:46:36,516 INFO L225 Difference]: With dead ends: 630 [2022-12-14 13:46:36,516 INFO L226 Difference]: Without dead ends: 630 [2022-12-14 13:46:36,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:46:36,517 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:46:36,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 2 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:46:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-12-14 13:46:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-12-14 13:46:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 3.055732484076433) internal successors, (1919), 629 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1919 transitions. [2022-12-14 13:46:36,527 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1919 transitions. Word has length 26 [2022-12-14 13:46:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:46:36,527 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 1919 transitions. [2022-12-14 13:46:36,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1919 transitions. [2022-12-14 13:46:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:46:36,529 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:46:36,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:46:36,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-12-14 13:46:36,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:36,731 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:46:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:46:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1913309933, now seen corresponding path program 1 times [2022-12-14 13:46:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:46:36,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564215238] [2022-12-14 13:46:36,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:46:36,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:46:36,737 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:46:36,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 13:46:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:46:37,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:46:37,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:46:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:46:37,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:46:37,079 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:46:37,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564215238] [2022-12-14 13:46:37,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564215238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:46:37,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:46:37,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:46:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615806643] [2022-12-14 13:46:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:46:37,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:46:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:46:37,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:46:37,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:46:37,081 INFO L87 Difference]: Start difference. First operand 630 states and 1919 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:46:37,269 INFO L93 Difference]: Finished difference Result 961 states and 2889 transitions. [2022-12-14 13:46:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:46:37,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:46:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:46:37,272 INFO L225 Difference]: With dead ends: 961 [2022-12-14 13:46:37,272 INFO L226 Difference]: Without dead ends: 961 [2022-12-14 13:46:37,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:46:37,272 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:46:37,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:46:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-12-14 13:46:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 956. [2022-12-14 13:46:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 954 states have (on average 3.0241090146750524) internal successors, (2885), 955 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2885 transitions. [2022-12-14 13:46:37,294 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2885 transitions. Word has length 27 [2022-12-14 13:46:37,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:46:37,295 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 2885 transitions. [2022-12-14 13:46:37,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2885 transitions. [2022-12-14 13:46:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:46:37,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:46:37,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:46:37,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 13:46:37,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:37,499 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:46:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:46:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1287346933, now seen corresponding path program 2 times [2022-12-14 13:46:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:46:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169547929] [2022-12-14 13:46:37,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 13:46:37,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:37,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:46:37,503 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:46:37,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 13:46:37,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 13:46:37,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:46:37,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:46:37,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:46:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:46:37,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:46:37,811 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:46:37,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169547929] [2022-12-14 13:46:37,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169547929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:46:37,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:46:37,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:46:37,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409001248] [2022-12-14 13:46:37,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:46:37,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:46:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:46:37,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:46:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:46:37,812 INFO L87 Difference]: Start difference. First operand 956 states and 2885 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:46:38,094 INFO L93 Difference]: Finished difference Result 1447 states and 4208 transitions. [2022-12-14 13:46:38,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:46:38,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:46:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:46:38,097 INFO L225 Difference]: With dead ends: 1447 [2022-12-14 13:46:38,097 INFO L226 Difference]: Without dead ends: 1447 [2022-12-14 13:46:38,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:46:38,097 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:46:38,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 8 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:46:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-12-14 13:46:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 776. [2022-12-14 13:46:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 774 states have (on average 3.0103359173126614) internal successors, (2330), 775 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 2330 transitions. [2022-12-14 13:46:38,110 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 2330 transitions. Word has length 27 [2022-12-14 13:46:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:46:38,110 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 2330 transitions. [2022-12-14 13:46:38,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 2330 transitions. [2022-12-14 13:46:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:46:38,112 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:46:38,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:46:38,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-14 13:46:38,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:38,313 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:46:38,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:46:38,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2046809727, now seen corresponding path program 3 times [2022-12-14 13:46:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:46:38,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243578062] [2022-12-14 13:46:38,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:46:38,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:46:38,315 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:46:38,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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 (14)] Waiting until timeout for monitored process [2022-12-14 13:46:38,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 13:46:38,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:46:38,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 13:46:38,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:46:40,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-12-14 13:46:40,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2022-12-14 13:46:40,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-12-14 13:46:41,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 252 [2022-12-14 13:46:41,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 226 [2022-12-14 13:46:41,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2022-12-14 13:46:41,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 13:46:42,071 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 13:46:42,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2022-12-14 13:46:42,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 160 [2022-12-14 13:46:42,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2022-12-14 13:46:43,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 123 [2022-12-14 13:46:43,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2022-12-14 13:46:43,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 13:46:44,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 13:46:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:46:44,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:46:44,408 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:46:44,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243578062] [2022-12-14 13:46:44,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243578062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:46:44,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:46:44,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 13:46:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211764138] [2022-12-14 13:46:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:46:44,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 13:46:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:46:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 13:46:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-14 13:46:44,410 INFO L87 Difference]: Start difference. First operand 776 states and 2330 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:46:47,648 INFO L93 Difference]: Finished difference Result 1866 states and 5401 transitions. [2022-12-14 13:46:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 13:46:47,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:46:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:46:47,651 INFO L225 Difference]: With dead ends: 1866 [2022-12-14 13:46:47,651 INFO L226 Difference]: Without dead ends: 1866 [2022-12-14 13:46:47,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-14 13:46:47,652 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 87 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:46:47,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 52 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 13:46:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-12-14 13:46:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 838. [2022-12-14 13:46:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 3.037081339712919) internal successors, (2539), 837 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2539 transitions. [2022-12-14 13:46:47,668 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2539 transitions. Word has length 27 [2022-12-14 13:46:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:46:47,668 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 2539 transitions. [2022-12-14 13:46:47,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2539 transitions. [2022-12-14 13:46:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:46:47,669 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:46:47,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:46:47,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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 (14)] Ended with exit code 0 [2022-12-14 13:46:47,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:47,870 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:46:47,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:46:47,871 INFO L85 PathProgramCache]: Analyzing trace with hash -370350381, now seen corresponding path program 4 times [2022-12-14 13:46:47,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:46:47,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270491923] [2022-12-14 13:46:47,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:46:47,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:47,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:46:47,873 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:46:47,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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 (15)] Waiting until timeout for monitored process [2022-12-14 13:46:48,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:46:48,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:46:48,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 13:46:48,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:46:50,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2022-12-14 13:46:50,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-12-14 13:46:50,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 13:46:50,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-12-14 13:46:50,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 13:46:50,957 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 13:46:50,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2022-12-14 13:46:51,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 224 [2022-12-14 13:46:52,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-12-14 13:46:52,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 13:46:53,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 188 [2022-12-14 13:46:53,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2022-12-14 13:46:54,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 123 [2022-12-14 13:46:54,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2022-12-14 13:46:55,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 13:46:55,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 13:46:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:46:56,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:46:56,055 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:46:56,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270491923] [2022-12-14 13:46:56,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270491923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:46:56,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:46:56,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 13:46:56,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023479823] [2022-12-14 13:46:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:46:56,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 13:46:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:46:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 13:46:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-14 13:46:56,057 INFO L87 Difference]: Start difference. First operand 838 states and 2539 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:46:59,007 INFO L93 Difference]: Finished difference Result 2270 states and 6576 transitions. [2022-12-14 13:46:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:46:59,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 13:46:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:46:59,011 INFO L225 Difference]: With dead ends: 2270 [2022-12-14 13:46:59,011 INFO L226 Difference]: Without dead ends: 2270 [2022-12-14 13:46:59,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-14 13:46:59,012 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 82 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:46:59,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 77 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 13:46:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2022-12-14 13:46:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 842. [2022-12-14 13:46:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 840 states have (on average 3.0404761904761903) internal successors, (2554), 841 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2554 transitions. [2022-12-14 13:46:59,029 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2554 transitions. Word has length 27 [2022-12-14 13:46:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:46:59,029 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 2554 transitions. [2022-12-14 13:46:59,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:46:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2554 transitions. [2022-12-14 13:46:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 13:46:59,030 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:46:59,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:46:59,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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 (15)] Ended with exit code 0 [2022-12-14 13:46:59,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:59,232 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-12-14 13:46:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:46:59,233 INFO L85 PathProgramCache]: Analyzing trace with hash 531200833, now seen corresponding path program 5 times [2022-12-14 13:46:59,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:46:59,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565917283] [2022-12-14 13:46:59,235 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 13:46:59,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:46:59,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:46:59,236 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 13:46:59,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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 (16)] Waiting until timeout for monitored process [2022-12-14 13:46:59,666 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 13:46:59,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-14 13:46:59,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 13:46:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:46:59,922 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 13:46:59,922 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 13:46:59,922 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (101 of 102 remaining) [2022-12-14 13:46:59,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (88 of 102 remaining) [2022-12-14 13:46:59,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 102 remaining) [2022-12-14 13:46:59,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 102 remaining) [2022-12-14 13:46:59,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (45 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 102 remaining) [2022-12-14 13:46:59,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 102 remaining) [2022-12-14 13:46:59,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 102 remaining) [2022-12-14 13:46:59,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 102 remaining) [2022-12-14 13:46:59,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 102 remaining) [2022-12-14 13:46:59,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/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 (16)] Ended with exit code 0 [2022-12-14 13:47:00,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 13:47:00,133 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:47:00,140 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 13:47:00,140 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:47:00,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:47:00 BasicIcfg [2022-12-14 13:47:00,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:47:00,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:47:00,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:47:00,212 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:47:00,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:24" (3/4) ... [2022-12-14 13:47:00,214 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 13:47:00,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:47:00,215 INFO L158 Benchmark]: Toolchain (without parser) took 157030.12ms. Allocated memory was 71.3MB in the beginning and 10.1GB in the end (delta: 10.1GB). Free memory was 47.6MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 7.2GB. Max. memory is 16.1GB. [2022-12-14 13:47:00,215 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:47:00,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.30ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 47.4MB in the beginning and 52.5MB in the end (delta: -5.2MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-12-14 13:47:00,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.36ms. Allocated memory is still 86.0MB. Free memory was 52.5MB in the beginning and 50.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 13:47:00,215 INFO L158 Benchmark]: Boogie Preprocessor took 38.38ms. Allocated memory is still 86.0MB. Free memory was 50.0MB in the beginning and 47.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:47:00,215 INFO L158 Benchmark]: RCFGBuilder took 1193.47ms. Allocated memory is still 86.0MB. Free memory was 47.1MB in the beginning and 53.6MB in the end (delta: -6.5MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2022-12-14 13:47:00,216 INFO L158 Benchmark]: TraceAbstraction took 155260.62ms. Allocated memory was 86.0MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 52.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 7.1GB. Max. memory is 16.1GB. [2022-12-14 13:47:00,216 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 10.1GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:47:00,216 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.15ms. Allocated memory is still 71.3MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.30ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 47.4MB in the beginning and 52.5MB in the end (delta: -5.2MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.36ms. Allocated memory is still 86.0MB. Free memory was 52.5MB in the beginning and 50.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.38ms. Allocated memory is still 86.0MB. Free memory was 50.0MB in the beginning and 47.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1193.47ms. Allocated memory is still 86.0MB. Free memory was 47.1MB in the beginning and 53.6MB in the end (delta: -6.5MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * TraceAbstraction took 155260.62ms. Allocated memory was 86.0MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 52.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 7.1GB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 10.1GB. Free memory is still 3.0GB. 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: 34.5s, 222 PlacesBefore, 105 PlacesAfterwards, 211 TransitionsBefore, 93 TransitionsAfterwards, 10744 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 117 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 196 TotalNumberOfCompositions, 48730 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18311, independent: 17665, independent conditional: 0, independent unconditional: 17665, dependent: 492, dependent conditional: 0, dependent unconditional: 492, unknown: 154, unknown conditional: 0, unknown unconditional: 154] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6442, independent: 6341, independent conditional: 0, independent unconditional: 6341, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6442, independent: 5644, independent conditional: 0, independent unconditional: 5644, dependent: 798, dependent conditional: 0, dependent unconditional: 798, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 798, independent: 697, independent conditional: 0, independent unconditional: 697, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3847, independent: 2707, independent conditional: 0, independent unconditional: 2707, dependent: 504, dependent conditional: 0, dependent unconditional: 504, unknown: 635, unknown conditional: 0, unknown unconditional: 635] ], Cache Queries: [ total: 18311, independent: 11324, independent conditional: 0, independent unconditional: 11324, dependent: 410, dependent conditional: 0, dependent unconditional: 410, unknown: 6577, unknown conditional: 0, unknown unconditional: 6577] , Statistics on independence cache: Total cache size (in pairs): 1000, Positive cache size: 958, Positive conditional cache size: 0, Positive unconditional cache size: 958, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 13, Unknown conditional cache size: 0, Unknown unconditional cache size: 13 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L882] 0 pthread_t t2229; [L883] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2229, ((void *)0), P0, ((void *)0))=0, t2229={11:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L884] 0 pthread_t t2230; [L885] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2230, ((void *)0), P1, ((void *)0))=1, t2229={11:0}, t2230={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 2 x$w_buff1 = x$w_buff0 [L795] 2 x$w_buff0 = 1 [L796] 2 x$w_buff1_used = x$w_buff0_used [L797] 2 x$w_buff0_used = (_Bool)1 [L798] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L798] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L799] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L800] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L801] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L802] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L803] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L804] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2231; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={11:0}, t2230={15:0}, t2231={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L887] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2231, ((void *)0), P2, ((void *)0))=2, t2229={11:0}, t2230={15:0}, t2231={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 3 x$flush_delayed = weak$$choice2 [L824] EXPR 3 \read(x) [L824] 3 x$mem_tmp = x [L825] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L827] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L828] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L829] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L830] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L831] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L834] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L835] EXPR 3 \read(x) [L835] 3 __unbuffered_p2_EAX = x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] 3 x = x$flush_delayed ? x$mem_tmp : x [L837] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2232; [L840] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 \read(x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L844] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L845] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L846] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L847] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L850] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L852] 3 return 0; [L889] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2232, ((void *)0), P3, ((void *)0))=3, t2229={11:0}, t2230={15:0}, t2231={5:0}, t2232={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L857] 4 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L807] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L808] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L809] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L810] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L811] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 2 return 0; [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 \read(x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L861] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L862] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L863] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L864] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L869] 4 return 0; [L891] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L893] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L893] RET 0 assume_abort_if_not(main$tmp_guard0) [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L896] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L897] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L898] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L899] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={11:0}, t2230={15:0}, t2231={5:0}, t2232={7:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L902] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L904] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L906] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=2, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 880]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 883]: 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: 889]: 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: 887]: 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: 885]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 284 locations, 102 error locations. Started 1 CEGAR loops. OverallTime: 155.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.6s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 531 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 531 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3120 IncrementalHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 51 mSDtfsCounter, 3120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479588occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 3132 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 84.9s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 4478 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2446 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 13:47:00,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46b623dc-c9b0-4e4a-aa1e-c52b98abd3c7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample